1083 search results - page 124 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
125
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
175
Voted
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
118
click to vote
CADE
2004
Springer
16 years 2 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
148
Voted
DLOG
2010
15 years 17 days ago
2010
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
123
Voted
LFCS
1992
Springer
15 years 6 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...