-
2
-
-
0033522718
-
Preferred answer sets for extended logic programs
-
109(l-2):297-356
-
Brewka, G. and Eiter, T. (1999). Preferred answer sets for extended logic programs. Artificial Intelligence, 109(l-2):297-356.
-
(1999)
Artificial Intelligence
-
-
Brewka, G.1
Eiter, T.2
-
3
-
-
84880801065
-
Answer set optimization
-
Morgan Kaufmann
-
Brewka, G., Niemela, I., andTruszczynski, M. (2003). Answer set optimization. In Pmc. of the 18th Int. Joint Conf. on Artificial Intelligence, pages 867-872. Morgan Kaufmann.
-
(2003)
Pmc. of the 18th Int. Joint Conf. on Artificial Intelligence
, pp. 867-872
-
-
Brewka, G.1
Niemela, I.2
andTruszczynski, M.3
-
5
-
-
0006419529
-
Default reasoning system deres
-
Morgan Kaufmann
-
Cholewinski, P., Marek, V. W., and Truszczynski, M. (1996). Default reasoning system deres. In Proc. of the 5th Int. Conf. KR'97, pages 518-528. Morgan Kaufmann.
-
(1996)
Proc. of the 5th Int. Conf. KR'97
, pp. 518-528
-
-
Cholewinski, P.1
Marek, V.W.2
Truszczynski, M.3
-
6
-
-
0012352628
-
Logic programs with compiled preferences
-
IOS Press
-
Delgrande, J. P., Schaub, T., and Tompits, H. (2000). Logic programs with compiled preferences. In Proc. of the 14th Eur. Conf. on Artificial Intelligence, pages 464- 468. IOS Press.
-
(2000)
Proc. of the 14th Eur. Conf. on Artificial Intelligence
, pp. 464-468
-
-
Delgrande, J.P.1
Schaub, T.2
Tompits, H.3
-
7
-
-
0345538690
-
A framework for compiling preferences in logic programs
-
Delgrande, J. P., Schaub, T., and Tompits, H. (2003). A framework for compiling preferences in logic programs. TPLP, 3(2):129-187.
-
(2003)
TPLP
, vol.3
, Issue.2
, pp. 129-187
-
-
Delgrande, J.P.1
Schaub, T.2
Tompits, H.3
-
8
-
-
2442570954
-
-
Delgrande, J. P., Schaub, T., Tompits, H., and K., W. (2004). A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence, 20(2):308-334.
-
Delgrande, J. P., Schaub, T., Tompits, H., and K., W. (2004). A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence, 20(2):308-334.
-
-
-
-
10
-
-
0041905616
-
Unfolding partiality and disjunctions in stable model semantics
-
Morgan Kaufmann
-
Janhunen, X, Niemela, I., Simons, P., and You, J.-H. (2000). Unfolding partiality and disjunctions in stable model semantics. In Proc. of the 7th Int. Conf. KR'00, pages 411-419. Morgan Kaufmann.
-
(2000)
Proc. of the 7th Int. Conf. KR'00
, pp. 411-419
-
-
Janhunen, X.1
Niemela, I.2
Simons, P.3
You, J.-H.4
-
11
-
-
22944463475
-
The dlv system
-
Springer
-
Leone, N., Pfeifer, G., Faber, W., Calimeri, R, Dell'Armi, T., Eiter, T, Gottlob, G., Ianni, G., Ielpa, G., Koch, K., Perri, S., and Polleres, A. (2002). The dlv system. In Proc. of Eur. Conf. JELIA'02, pages 537-540. Springer.
-
(2002)
Proc. of Eur. Conf. JELIA'02
, pp. 537-540
-
-
Leone, N.1
Pfeifer, G.2
Faber, W.3
Calimeri, R.4
Dell'Armi, T.5
Eiter, T.6
Gottlob, G.7
Ianni, G.8
Ielpa, G.9
Koch, K.10
Perri, S.11
Polleres, A.12
-
12
-
-
0034301195
-
Priorized logic programming and its application to commonsense reasoning
-
Sakama, C. and Inoue, K. (2000). Priorized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123:185-222.
-
(2000)
Artificial Intelligence
, vol.123
, pp. 185-222
-
-
Sakama, C.1
Inoue, K.2
-
14
-
-
9444247029
-
Computing preferred answer sets in answer set programming
-
Springer
-
Wakaki, T, Inoue, K. nd Sakama, C, and Nitta, K. (2003). Computing preferred answer sets in answer set programming. In Proc. of the 10th Int. Conf. LPAR'03, pages 259-273. Springer.
-
(2003)
Proc. of the 10th Int. Conf. LPAR'03
, pp. 259-273
-
-
Wakaki, T.1
Inoue, K.2
nd Sakama, C.3
Nitta, K.4
|