4617 search results - page 733 / 924 » Automation of Diagrammatic Reasoning |
196
click to vote
LPNMR
2004
Springer
16 years 14 days 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 ...
189
click to vote
LPNMR
2004
Springer
16 years 14 days 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 ...
186
click to vote
LPNMR
2004
Springer
16 years 14 days 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...
207
click to vote
LPNMR
2004
Springer
16 years 14 days 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...
227
click to vote
MDAFA
2004
Springer
16 years 14 days ago
2004
Springer
MDA software development requires the interoperability of a wide range of modelling services (operations taking models as inputs and outputs), such as model edition, model transfor...