6554 search results - page 380 / 1311 » Constraint Logic Programming |
181
click to vote
IJCAI
2007
15 years 8 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
175
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
269
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
293
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
150
Voted
UM
2009
Springer
16 years 1 months ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...