4192 search results - page 93 / 839 » Probabilistic Logic Programming |
TPLP
2002
13 years 9 months ago
2002
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
NMR
2004
Springer
14 years 3 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...