499 search results - page 31 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
126
click to vote
IJCAI
2007
15 years 5 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
146
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
132
click to vote
ESWS
2009
Springer
15 years 11 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
108
click to vote
FAC
2000
15 years 4 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...