700 search results - page 21 / 140 » On Termination of Constraint Logic Programs |
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approac...
IFIP
1998
Springer
15 years 1 months ago
1998
Springer
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
CADE
2001
Springer
15 years 2 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
77
Voted
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
84
Voted
AAAI
2004
14 years 11 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...