2540 search results - page 78 / 508 » Abstract Logics as Dialgebras |
176
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
172
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
193
click to vote
RULEML
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
150
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
161
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...