1117 search results - page 10 / 224 » Partial Models of Extended Generalized Logic Programs |
IJCAI
1989
13 years 9 months ago
1989
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
ATS
2005
IEEE
13 years 10 months ago
2005
IEEE
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
LPNMR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
PEPM
2007
ACM
14 years 2 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...