1814 search results - page 116 / 363 » Extended First-Order Logic |
150
click to vote
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
108
click to vote
ICCAD
2004
IEEE
16 years 7 days ago
2004
IEEE
We propose a new approach to library-based technology mapping, based on the method of logical effort. Our algorithm is close to optimal for fanout-free circuits, and is extended t...
136
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
142
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
113
click to vote
APAL
2006
15 years 3 months ago
2006
In this paper an alternative Skolemization method is introduced that for a large class of formulas is sound and complete with respect to intuitionistic logic. This class extends t...