352 search results - page 24 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
170
click to vote
AMAI
1999
Springer
15 years 2 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
117
click to vote
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
144
click to vote
RULEML
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
154
click to vote
WWW
2003
ACM
16 years 3 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
128
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for v...