4513 search results - page 286 / 903 » Logic programming with satisfiability |
153
click to vote
FSTTCS
1999
Springer
15 years 8 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
137
click to vote
ECAI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
154
click to vote
WLP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
138
click to vote
KSEM
2010
Springer
15 years 2 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
237
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...