232 search results - page 23 / 47 » Completeness and Decidability in Sequence Logic |
ILP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
JELIA
2004
Springer
15 years 2 months ago
2004
Springer
Practical reasoners are resource-bounded—in particular they require time to derive consequences of their knowledge. Building on the Timed Reasoning Logics (TRL) framework introdu...
KR
2004
Springer
15 years 2 months ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
JAPLL
2006
14 years 9 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...