-
1
-
-
84958987603
-
Minimal model generation with unit hyper-resolution tableau
-
Springer-Verlag, Berlin/New York
-
Bry, F. and Yahya, A., Minimal Model Generation with Unit Hyper-Resolution Tableau, in: Proceedings of the Fifth Workshop of Analytic Tableaux and Related Methods, Lecture Notes in Computer Science 1071, Springer-Verlag, Berlin/New York, 1996, pp. 143-159.
-
(1996)
Proceedings of the Fifth Workshop of Analytic Tableaux and Related Methods, Lecture Notes in Computer Science
, vol.1071
, pp. 143-159
-
-
Bry, F.1
Yahya, A.2
-
4
-
-
21344488750
-
Disjunctive LP + integrity constraints = stable model semantics
-
Fernández, J. A., Lobo, J., Minker, J., and Subrahmanian, V. S., Disjunctive LP + Integrity Constraints = Stable Model Semantics, Ann. Mathematics and Artificial Intelligence 8(3/4):449-474 (1993).
-
(1993)
Ann. Mathematics and Artificial Intelligence
, vol.8
, Issue.3-4
, pp. 449-474
-
-
Fernández, J.A.1
Lobo, J.2
Minker, J.3
Subrahmanian, V.S.4
-
5
-
-
0026263504
-
Bottom-up evaluation of hierarchical disjunctive deductive databases
-
MIT Press, Cambridge, MA
-
Fernández, J. A. and Minker, J., Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases, in: Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 660-675.
-
(1991)
Proceedings of the Eighth International Conference on Logic Programming
, pp. 660-675
-
-
Fernández, J.A.1
Minker, J.2
-
6
-
-
0029393298
-
Bottom-up computation of perfect models for disjunctive theories
-
Fernández, J. A. and Minker, J., Bottom-Up Computation of Perfect Models for Disjunctive Theories, J. Logic Programming 25(1):33-51 (1995).
-
(1995)
J. Logic Programming
, vol.25
, Issue.1
, pp. 33-51
-
-
Fernández, J.A.1
Minker, J.2
-
7
-
-
0001119421
-
The stable model semantics for logic programming
-
MIT Press, Cambridge, MA
-
Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
-
(1988)
Proceedings of the Fifth International Conference and Symposium on Logic Programming
, pp. 1070-1080
-
-
Gelfond, M.1
Lifschitz, V.2
-
8
-
-
84959408863
-
Embedding negation as failure into a model generation theorem prover
-
Inoue, K., Koshimura, M., and Hasegawa, R., Embedding Negation as Failure into a Model Generation Theorem Prover, in: Proceedings of the International Conference on Automated Deduction, 1992, pp. 400-415.
-
(1992)
Proceedings of the International Conference on Automated Deduction
, pp. 400-415
-
-
Inoue, K.1
Koshimura, M.2
Hasegawa, R.3
-
10
-
-
0000888571
-
Un théorèm sur les fonctions d'ensembles
-
Knaster, B., Un théorèm sur les fonctions d'ensembles, Annals Soc. Pol. Math. 6:133-134 (1928).
-
(1928)
Annals Soc. Pol. Math.
, vol.6
, pp. 133-134
-
-
Knaster, B.1
-
12
-
-
0003771686
-
-
MIT Press, Cambridge, MA
-
Lobo, J., Minker, J., and Rajasekar, A., Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
-
(1992)
Foundations of Disjunctive Logic Programming
-
-
Lobo, J.1
Minker, J.2
Rajasekar, A.3
-
13
-
-
0000534618
-
SATCHMORE: SATCHMO with relevance
-
Loveland, D., Reed, D., and Wilson, D., SATCHMORE: SATCHMO with RElevance, J. Automated Reasoning 14:325-351 (1995).
-
(1995)
J. Automated Reasoning
, vol.14
, pp. 325-351
-
-
Loveland, D.1
Reed, D.2
Wilson, D.3
-
15
-
-
85023410475
-
On indefinite databases and the closed world assumption
-
Springer-Verlag, Berlin/New York
-
Minker, J., On Indefinite Databases and the Closed World Assumption, in: Proceedings of the Conference on Automated Deduction 1982, Lecture Notes in Computer Science 138, Springer-Verlag, Berlin/New York, 1982, pp. 292-308.
-
(1982)
Proceedings of the Conference on Automated Deduction 1982, Lecture Notes in Computer Science
, vol.138
, pp. 292-308
-
-
Minker, J.1
-
16
-
-
0025460906
-
A fixpoint semantics for disjunctive logic programs
-
Minker, J. and Rajasekar, A., A Fixpoint Semantics for Disjunctive Logic Programs, J. Logic Programming 9(1):45-74 (1990).
-
(1990)
J. Logic Programming
, vol.9
, Issue.1
, pp. 45-74
-
-
Minker, J.1
Rajasekar, A.2
-
17
-
-
84958961954
-
A tableau calculus for minimal model reasoning
-
Springer-Verlag, Berlin/New York
-
Niemelä, I., A Tableau Calculus for Minimal Model Reasoning, in: Proceedings of the Fifth Workshop of Analytic Tableaux and Related Models, Lecture Notes in Computer Science 1071, Springer-Verlag, Berlin/New York, 1996, pp. 278-294.
-
(1996)
Proceedings of the Fifth Workshop of Analytic Tableaux and Related Models, Lecture Notes in Computer Science
, vol.1071
, pp. 278-294
-
-
Niemelä, I.1
-
18
-
-
0001599027
-
On the declarative semantics of deductive databases and logic programming
-
J. Minker (ed.), Morgan Kaufmann, Los Altos, CA
-
Przymusinski, T. C., On the Declarative Semantics of Deductive Databases and Logic Programming, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
-
(1988)
Foundations of Deductive Databases and Logic Programming
, pp. 193-216
-
-
Przymusinski, T.C.1
-
20
-
-
0000810454
-
Stable semantics for disjunctive programs
-
Przymusinski, T. C., 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
-
21
-
-
0001685428
-
Automatic deduction with hyper-resolution
-
Robinson, J. A., Automatic Deduction with Hyper-Resolution, Int. J. Computer Mathematics 1:227-234 (1965).
-
(1965)
Int. J. Computer Mathematics
, vol.1
, pp. 227-234
-
-
Robinson, J.A.1
-
22
-
-
84959347772
-
Computing stable and partial stable models of extended disjunctive logic programs
-
J. Dix, L. M. Pereira, and T. C. Przymusinski (eds.), Springer-Verlag, Berlin/New York
-
Ruiz, C. and Minker, J., Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs, in: J. Dix, L. M. Pereira, and T. C. Przymusinski (eds.), Nonmonotonic Extensions of Logic Programming, Lecture Notes in Computer Science 927, Springer-Verlag, Berlin/New York, 1995, pp. 205-229.
-
(1995)
Nonmonotonic Extensions of Logic Programming, Lecture Notes in Computer Science
, vol.927
, pp. 205-229
-
-
Ruiz, C.1
Minker, J.2
-
26
-
-
84972541021
-
A lattice-theoretical fixpoint theorem and its applications
-
Tarski, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications, Pacific J. Mathematics 5:285-309 (1995).
-
(1995)
Pacific J. Mathematics
, vol.5
, pp. 285-309
-
-
Tarski, A.1
-
27
-
-
0017013056
-
The semantics of predicate logic as a programming language
-
van Emden, M. H. and Kowalski, R. A., The Semantics of Predicate Logic as a Programming Language, J. ACM 23(4):733-742 (1976).
-
(1976)
J. ACM
, vol.23
, Issue.4
, pp. 733-742
-
-
Van Emden, M.H.1
Kowalski, R.A.2
-
28
-
-
84990606045
-
Unfounded sets and well-founded semantics for general logic programs
-
Van Gelder, A., Ross, K. A., and Schlipff, J. S., Unfounded Sets and Well-Founded Semantics for General Logic Programs, in: Proceedings of the Seventh ACM Symposium on Principles of Database Systems, 1988, pp. 221-230.
-
(1988)
Proceedings of the Seventh ACM Symposium on Principles of Database Systems
, pp. 221-230
-
-
Van Gelder, A.1
Ross, K.A.2
Schlipff, J.S.3
|