314 search results - page 7 / 63 » Compactness Properties for Stable Semantics of Logic Program... |
ICLP
2010
Springer
15 years 1 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...
169
click to vote
PADL
2009
Springer
15 years 10 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...
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
AAAI
2004
14 years 10 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 (...
103
Voted
AI
2001
Springer
15 years 1 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...