1083 search results - page 60 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
105
click to vote
LPNMR
1999
Springer
15 years 6 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
ASP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
124
click to vote
LOPSTR
2004
Springer
15 years 7 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
114
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
125
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...