55 search results - page 1 / 11 » Abduction of Linear Arithmetic Constraints |
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
ICLP
2007
Springer
13 years 8 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...