438 search results - page 18 / 88 » On theorem proving in annotated logics |
SYNTHESE
2010
13 years 7 months ago
2010
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
CADE
2008
Springer
14 years 9 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
PLDI
2011
ACM
12 years 11 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
CADE
2000
Springer
14 years 29 days ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
IJCAI
1997
13 years 10 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...