827 search results - page 57 / 166 » Proof-Theoretic Soundness and Completeness |
TABLEAUX
2005
Springer
14 years 2 months ago
2005
Springer
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
CAV
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
DALT
2003
Springer
14 years 2 months ago
2003
Springer
We introduce and motivate a non-standard multi-modal logic to represent and reason about ignorance in Multi-Agent Systems. We argue that in Multi-agent systems being able to reaso...
CSL
2001
Springer
14 years 1 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
ALP
1990
Springer
14 years 1 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...