977 search results - page 48 / 196 » Logic programming with infinite sets |
142
click to vote
ICLP
1994
Springer
15 years 4 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
101
Voted
AAAI
2004
15 years 1 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 (...
106
Voted
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
122
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
TCS
2008
15 years 10 days ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...