Evaluating general purpose automated theorem proving systems
نویسندگان
چکیده
منابع مشابه
Evaluating general purpose automated theorem proving systems
A key concern of ATP research is the development of more powerful systems, capable of solving more difficult problems within the same resource limits. In order to build more powerful systems, it is important to understand which systems, and hence which techniques, work well for what types of problems. This paper deals with the empirical evaluation of general purpose ATP systems, to determine wh...
متن کاملAutomated Theorem Proving for General Game Playing
A general game player is a system that understands the rules of an unknown game and learns to play this game well without human intervention. To succeed in this endeavor, systems need to be able to extract and prove game-specific knowledge from the mere game rules. We present a practical approach to this challenge with the help of Answer Set Programming. The key idea is to reduce the automated ...
متن کاملAutomated Theorem Proving for General Game Playing
A general game player is a system that understands the rules of an unknown game and learns to play this game well without human intervention. To succeed in this endeavor, systems need to be able to extract and prove game-specific knowledge from the mere game rules. We present a practical approach to this challenge with the help of Answer Set Programming. The key idea is to reduce the automated ...
متن کاملAutomated Theorem Proving
Material for the course Automated Theorem Proving at Carnegie Mellon University, Fall 1999. This includes revised versions from the course notes on Linear Logic (Spring 1998) and Computation and Deduction (Spring 1997). Material for this course is available at http://www.cs.cmu.edu/~fp/courses/atp/. Please send comments to [email protected] This material is in rough draft form and is likely to cont...
متن کاملAutomated Theorem Proving in aSimple
Higher-order representation techniques allow elegant encod-ings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over LF encodings, and describe its implementation in Twelf, a special-purpose automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2001
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(01)00113-8