LPAR
2012
Springer
12 years 4 days ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
AMAI
1999
Springer
13 years 4 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
SLP
1993
13 years 5 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
SWAP
2008
13 years 6 months ago
2008
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
JELIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
CADE
2006
Springer
14 years 4 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...