42 search results - page 7 / 9 » Semantic Selection of Premisses for Automated Theorem Provin... |
110
click to vote
AAAI
1993
15 years 3 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...
119
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
116
click to vote
CSFW
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
132
click to vote
TPHOL
2005
IEEE
15 years 7 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
101
click to vote
LPNMR
1990
Springer
15 years 6 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 ...