Towards programming in default logic

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

Volumn 1079, Issue , 1996, Pages 223-232

  Cholewiński, Paweł ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); INTELLIGENT SYSTEMS;

DEFAULT LOGIC; DEFAULT REASONING; DEFAULT THEORY; ENCODINGS; EXISTING SYSTEMS; FIRST ORDER; OPEN DEFAULTS;

COMPUTER CIRCUITS;

EID: 84949768738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61286-6_147     Document Type: Conference Paper

References (19)

1. G. Antoniou, E. Langetepe, and V. Sperschneider. New proofs in default logic theory. Annals of Mathematics and Artificial Intelligence, 12:215-230, 1994.
2. R. Ben-Eliyahu and L. Palopoli. Reasoning with minimal models: Efficient algorithms and applications. In Proceedings of KR'94, San Francisco, CA, 1994. Morgan Kaufmann.
3. C. Bell, A. Nerode, R. Ng, W. Pugh, and V.S. Subrahmanian. Implementing stable semantics by linear programming. In A. Nerode and L. Pereira, editors, Logic programming and non-monotonic reasoning. MIT Press, 1993.
4. P. Cholewifiski. Reasoning with stratified default theories. In Proceedings of LPNMR' 95. Berlin: Springer-Verlag, 1995. Lecture Notes in Computer Science 928.
5. P. Cholewifiski. Stratified default theories. In Proceedings of CSL'94. Berlin: Springer-Verlag, 1995. Lecture Notes in Computer Science 933.
6. P. Cholewifiski, W. Marek, A. Mikitiuk, and M. Truszczyfiski. Default reasoning system -- an implementation of default reasoning. In preparation., 1995.
7. P. Cholewifiski, W. Marek, A. Mikitiuk, and M. Truszczyfiski. Experimenting with nonmonotonic reasoning. In Proceedings of the 12th International Conference on Logic Programming, Cambridge, MA, 1995. MIT Press.
8. W. Chen, T. Swift, and D.S. Warren. Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming, 1994.
9. M. Dixon and J. de Kleer. Massively parallel assumption-based truth maintenance. In Non-monotonic reasoning, pages 131-142. Berlin: Springer-Verlag, 1989. Lecture Notes in Artificial Intelligence, 346.
10. S.P. Engelson, R. Feldman, M. Koppel, A. Nerode, and J.B. Remmel. Frost: A forward chaining rule ordering system for reasoning with nonmonotonic rule systems. In Proceedings of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotomic Reasonigs Systems, 1995.
11. M.L. Ginsberg. A circumscriptive theorem prover. In Non-monotonic reasoning, pages 100-114. Berlin: Springer-Verlag, 1989. Lecture Notes in Artificial Intelligence 346.
12. D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. Addison-Wesley, 1993.
13. W. Marek, A. Nerode, and J. B. Remmel. Rule systems, well-orderings and forward chaining. Submitted for publication., 1995.
14. W. Marek and M. Truszczyński. Nonmonotonic logics; context-dependent reasoning. Berlin: Springer-Verlag, 1993.
15. I. Niemelä. Towards efficient default reasoning. In Proceedings of IJCAI-95, pages 312-318. Morgan Kaufmann, 1995.
16. I. Niemelä and P. Simmons. Evaluating an algorithm for default reasoning. In Proceedings of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotomic Reasonigs Systems, 1995.
17. D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27-47, 1988.
18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
19. J.A. Robinson. Machine-oriented logic based on resolution principle. Journal of the ACM, 12:23-41, 1965.