10 search results - page 1 / 2 » Logic Programs With Monotone Cardinality Atoms |
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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 (...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...