-
1
-
-
0024700212
-
Eliminating the fixed predicates from a circumscription
-
July
-
J. de Kleer and K. Konolige. Eliminating the fixed predicates from a circumscription. Artificial Intelligence, 39(3):391-398, July 1989.
-
(1989)
Artificial Intelligence
, vol.39
, Issue.3
, pp. 391-398
-
-
De Kleer, J.1
Konolige, K.2
-
2
-
-
0032665757
-
The diagnosis frontend of the DLV system
-
T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The diagnosis frontend of the DLV system. AI Communications, 12(1-2):99-111, 1999.
-
(1999)
AI Communications
, vol.12
, Issue.1-2
, pp. 99-111
-
-
Eiter, T.1
Faber, W.2
Leone, N.3
Pfeifer, G.4
-
3
-
-
21844511738
-
On the computational cost of disjunctive logic programming: Propositional case
-
T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Math. and AI, 15:289-323, 1995.
-
(1995)
Annals of Math. and AI
, vol.15
, pp. 289-323
-
-
Eiter, T.1
Gottlob, G.2
-
5
-
-
77951505493
-
Classical negation in logic programs and disjunctive databases
-
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
-
(1991)
New Generation Computing
, vol.9
, pp. 365-385
-
-
Gelfond, M.1
Lifschitz, V.2
-
7
-
-
33745231666
-
Unfolding partiality and disjunctions in stable model semantics
-
To appear
-
T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 2005. To appear, see http://www.acm.org/tocl/accepted.html.
-
(2005)
ACM Transactions on Computational Logic
-
-
Janhunen, T.1
Niemelä, I.2
Seipel, D.3
Simons, P.4
You, J.-H.5
-
8
-
-
22944445494
-
Capturing parallel circumscription with disjunctive logic programs
-
Lisbon, Portugal, September. Springer-Verlag. LNAI 3229
-
T. Janhunen and E. Oikarinen. Capturing parallel circumscription with disjunctive logic programs. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04, pages 134-146, Lisbon, Portugal, September 2004. Springer-Verlag. LNAI 3229.
-
(2004)
Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04
, pp. 134-146
-
-
Janhunen, T.1
Oikarinen, E.2
-
9
-
-
9444233323
-
Loop formulas for circumscription
-
San Jose, California, USA, July. The MIT Press
-
J. Lee and F. Lin. Loop formulas for circumscription. In Proceedings of 19th National Conference on Artificial Intelligence, pages 281-286, San Jose, California, USA, July 2004. The MIT Press.
-
(2004)
Proceedings of 19th National Conference on Artificial Intelligence
, pp. 281-286
-
-
Lee, J.1
Lin, F.2
-
10
-
-
33745244351
-
The DLV system for knowledge representation and reasoning
-
To appear
-
N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 2005. To appear, see http://www.acm.org/tocl/accepted.html.
-
(2005)
ACM Transactions on Computational Logic
-
-
Leone, N.1
Pfeifer, G.2
Faber, W.3
Eiter, T.4
Gottlob, G.5
Scarcello, F.6
-
11
-
-
0001884486
-
Computing circumscription
-
Los Angeles, California, USA, August Morgan Kaufmann
-
V. Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121-127, Los Angeles, California, USA, August 1985. Morgan Kaufmann.
-
(1985)
Proceedings of the 9th International Joint Conference on Artificial Intelligence
, pp. 121-127
-
-
Lifschitz, V.1
-
12
-
-
0000810454
-
Stable semantics for disjunctive programs
-
T.C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
-
(1991)
New Generation Computing
, vol.9
, pp. 401-424
-
-
Przymusinski, T.C.1
-
13
-
-
0023329093
-
A theory of diagnosis from first principles
-
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57-95, 1987.
-
(1987)
Artificial Intelligence
, vol.32
, pp. 57-95
-
-
Reiter, R.1
-
15
-
-
35048817421
-
Compiling prioritized circumscription into answer set programming
-
Saint-Malo, France, September. Springer-Verlag
-
T. Wakaki and K. Inoue. Compiling prioritized circumscription into answer set programming. In Proceedings of the 20th International Conference on Logic Programming, pages 356-370, Saint-Malo, France, September 2004. Springer-Verlag.
-
(2004)
Proceedings of the 20th International Conference on Logic Programming
, pp. 356-370
-
-
Wakaki, T.1
Inoue, K.2
|