4192 search results - page 303 / 839 » Probabilistic Logic Programming |
146
click to vote
BIRTHDAY
2005
Springer
16 years 1 days ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
190
click to vote
CONCUR
2005
Springer
16 years 1 days ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
153
click to vote
TACAS
2007
Springer
16 years 18 days ago
2007
Springer
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
192
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...