29 search results - page 1 / 6 » Answer Sets for Logic Programs with Arbitrary Abstract Const... |
AAAI
2006
13 years 6 months ago
2006
AAAI
2008
13 years 6 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
LPNMR
2009
Springer
13 years 11 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
AAAI
2004
13 years 6 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 (...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...