120 search results - page 11 / 24 » Covered Clause Elimination |
WECWIS
2003
IEEE
15 years 2 months ago
2003
IEEE
Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguiti...
EUROMICRO
2005
IEEE
15 years 3 months ago
2005
IEEE
Objective: Formal definition of composition assessment metrics for CBSE, using an extension of the CORBA Component Model metamodel as the ontology for describing component assembl...
TABLEAUX
2009
Springer
15 years 2 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
100
Voted
CSL
2001
Springer
15 years 2 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...
79
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...