4573 search results - page 708 / 915 » Automated Reasoning |
136
Voted
LPNMR
2004
Springer
15 years 9 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 ...
129
Voted
LPNMR
2004
Springer
15 years 9 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 ...
144
Voted
LPNMR
2004
Springer
15 years 9 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...
146
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
130
Voted
NMR
2004
Springer
15 years 9 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...