2291 search results - page 109 / 459 » Logic Programming and Model Checking |
141
Voted
FORMATS
2004
Springer
15 years 7 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
141
click to vote
DALT
2008
Springer
15 years 4 months ago
2008
Springer
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
109
click to vote
CCIA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
219
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
160
Voted
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...