Computing strongest necessary and weakest sufficient conditions of first-order formulas

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 145-151

  Doherty, Patrick ^a   Łukaszewicz, Witold ^a   Szałas, Andrzej ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT COMMUNICATIONS; FIRST ORDER LOGIC; FIRST-ORDER; FIRST-ORDER FORMULAS; QUANTIFIER ELIMINATION; SITUATION CALCULUS; SUFFICIENT CONDITIONS;

ARTIFICIAL INTELLIGENCE;

FORMAL LOGIC;

EID: 84880896799     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Pub. Co., 1996.
2. F.M. Brown. Boolean Reasoning. Kluwer Academic Publishers, Dordrecht, 1990.
3. M. Cadoli. Tractable Reasoning in Artificial Intelligence, volume 941 of LNAI. Springer-Verlag, Berlin Heidelberg, 1995.
4. E. W Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
5. P. Doherty, W. Lukaszewicz, and A. Szalas. A reduction result for circumscribed semi-Horn formulas. Fundamenta Informaticae, 28(3-4):261-271, 1996. (Pubitemid 126715046)
6. P. Doherty, W. Lukaszewicz, and A. Szalas. Computing circumscription revisited. Journal of Automated Reasoning, 18(3):297-336, 1997.
7. P. Doherty, W. Lukaszewicz, and A. Szalas. General domain circumscription and its effective reductions. Fundamenta Informaticae, 36(1):23-55, 1998. (Pubitemid 128436255)
8. H-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, Heidelberg, 1995.
9. H. Kautz and B. Selman. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996. (Pubitemid 126628034)
10. F. Lin and R. Reiter. Forget it! In R. Greiner and D. Subramanian, editors, Working Notes of AAAI Fall Symposium on Relevance, pages 154-159, Menlo Park, Ca., 1994. AAAI.
11. F. Lin and R. Reiter. How to progress a database. Artificial Intelligence, 92(1-2):131-167, 1997. (Pubitemid 127414142)
12. F. Lin. On strongest necessary and weakest sufficient conditions. In A.G. Cohn, F. Giunchiglia, and B. Selman, editors, KR2000, pages 167-175, 2000.
13. J. McCarthy. Approximate objects and approximate theories. In A.G. Cohn, F. Giunchiglia, and B. Selman, editors, KR2000, pages 519-526, 2000.
14. A. Nonnengart and A. Szalas. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In E. Orlowska, editor, Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing, pages 307-328. Springer Physica-Verlag, 1998.
15. A. Nonnengart, H.J. Ohlbach, and A. Szalas. Elimination of predicate quantifiers. In H.J. Ohlbach and U. Reyle, editors, Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pages 159-181. Kluwer, 1999.