150 search results - page 11 / 30 » A Functorial Framework for Constraint Normal Logic Programmi... |
TAP
2010
Springer
13 years 5 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
CSCLP
2004
Springer
14 years 27 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
ICLP
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...