19 search results - page 3 / 4 » lpnmr 2004 |
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
2004
Springer
13 years 10 months ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while c...
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 ...