352 search results - page 34 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
150
click to vote
AMAI
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
138
click to vote
IJCAI
2001
15 years 4 months ago
2001
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
103
click to vote
ICLP
2010
Springer
15 years 6 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
117
click to vote
AAAI
2004
15 years 4 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
231
click to vote
PADL
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...