Sciweavers

438 search results - page 22 / 88
» On theorem proving in annotated logics
Sort
View
ACL2
2006
ACM
14 years 2 months ago
An embedding of the ACL2 logic in HOL
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
Michael J. C. Gordon, Warren A. Hunt Jr., Matt Kau...
CLIMA
2007
13 years 10 months ago
Proof Theory for Distributed Knowledge
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
Raul Hakli, Sara Negri
JAIR
2011
103views more  JAIR 2011»
13 years 3 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
IGPL
2008
124views more  IGPL 2008»
13 years 8 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
LPAR
2004
Springer
14 years 2 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler