183 search results - page 9 / 37 » Automated theorem proving by resolution in non-classical log... |
STOC
1999
ACM
13 years 12 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
IJCAI
1997
13 years 9 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...
PLDI
2011
ACM
12 years 10 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...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
DLOG
2010
13 years 5 months ago
2010
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...