Sciweavers

174 search results - page 23 / 35
» Loop Calculus for Satisfiability
Sort
View
CADE
2007
Springer
14 years 7 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
CSL
2001
Springer
13 years 12 months ago
Constrained Hyper Tableaux
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...
Jan van Eijck
TABLEAUX
1998
Springer
13 years 11 months ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay
CADE
2010
Springer
13 years 8 months ago
iProver-Eq: An Instantiation-Based Theorem Prover with Equality
iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with sup...
Konstantin Korovin, Christoph Sticksel
IANDC
2008
140views more  IANDC 2008»
13 years 7 months ago
Information flow security in Boundary Ambients
A variant of the Mobile Ambient calculus, called Boundary Ambients, is introduced, supporting the modelling of multi-level security policies. Ambients that may guarantee to proper...
Chiara Braghin, Agostino Cortesi, Riccardo Focardi