183 search results - page 31 / 37 » Automated theorem proving by resolution in non-classical log... |
ICLP
1991
Springer
13 years 11 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
AAAI
1993
13 years 8 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...