1321 search results - page 34 / 265 » Subtyping in Logical Form |
CONCUR
2003
Springer
15 years 5 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
ICLP
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
102
click to vote
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
100
click to vote
KI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
109
click to vote
LOPSTR
1998
Springer
15 years 4 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...