105 search results - page 8 / 21 » Automated Reasoning in Some Local Extensions of Ordered Stru... |
115
click to vote
CSL
2007
Springer
15 years 11 months ago
2007
Springer
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
140
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
137
click to vote
ICLP
2004
Springer
15 years 10 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
167
click to vote
TPHOL
2009
IEEE
15 years 12 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
152
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...