Programs with universally quantified embedded implications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1265, Issue , 1997, Pages 309-323

  Petukhin, Vyacheslav ^a  

^a IRKUTSK STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; LOGIC PROGRAMMING; SEMANTICS;

LOGIC PROGRAMS; NONMONOTONIC; STABLE MODEL SEMANTICS; THE STANDARD MODEL; WELL FOUNDED SEMANTICS;

COMPUTER CIRCUITS;

EID: 84946750536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_23     Document Type: Conference Paper

References (20)

1. K. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In Foundations of Deductive Databases and Logic Programming, (ed. J.Minker), pages 193-216, 1986.
2. K. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19,20:9-71, 1994.
3. A. Bowers, P. Hill, F. Ibanez. Universal quantifiers in logic programs. WoLLIC-96, Salvador (Bahia), Brazil, Journal of IGPL., vol. 4, Num. 3, pp. 483-486, 1996.
4. D. Chan. Constructive negation based on the completed database. In Proc. 5th ICSLP, Seattle, ALP, MIT Press, pages 111-125, 1988.
5. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. 5th ICSLP, Seattle, ALP, MIT Press, pages 1070-1080, 1988.
6. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994, ISBN 0-262-08229-2.
7. R. Kowalski. Logic for Problem Solving. Elsevier, New York, 1979.
8. R. Kowalski. Logic Programming. In Proceedings of IFIP, 1983.
9. V. Lifschitz. SLDNF, constructive negation and grounding. In Proceedings of the Twelfth International Conference on Logic Programming, pages 581-595, 1995.
10. V. Lifschitz, N. McCain, T. Przymusinski and R. Stärk. Loop checking and the well-founded semantics. In Logic Programming and Non-Monotonic Reasoning: Proceedings of the Third International Conference, pages 127-142, 1995.
11. V. Lifschitz. Foundation for logic programming. In Knowledge Representation, 1996.
12. J.W. Lloyd and R.W. Topor. Making Prolog More Expressive. Journal of Logic Programming, 3(1): pages 225-240, 1984.
13. L. Naish. Negation and quantifiers in NU-Prolog. In Proceedings of the Third Int. Conf. on Logic Programming, 225 in LNCS, Springer-Verlag, pages 624-634, 1986.
14. V. Petukhin. Implications as Implication Premises and Bounded Quantifiers. (In Russian). In Algebra, Logic and Applications, pages 233-242. Irkutsk University, 1994.
15. V. Petukhin. Describing Combinatorial Problems in Horn Clause Language Extended by Implication. In 2nd Workshop on NSL, pages 62-63. Irkutsk, 1995.
16. T.C. Przymusinski. Perfect model semantics. In Proc. 5th ICSLP, Seattle, pages 1081-1096, 1988.
17. R.F. Stark. A quantifier-free completion of logic programs. In Computer Science Logic CSL’89, 440 in LNCS, Springer-Verlag, pages 384-395, 1990.
18. A. van Gelder. Negation as Failure Using Tight Derivations for General Logic Programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, pages 149-176, 1988.
19. A. van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. J. of the ACM, 38(3):620-650, 1991.
20. A. Voronkov. Logic Programming with Bounded Quantifiers, in Proc. RCLP, St.Petersburg, 592 in LNCS, pages 286-293, Springer, 1992.