Sciweavers

756 search results - page 98 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
POPL
2005
ACM
15 years 10 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
PPDP
2007
Springer
15 years 3 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
ICLP
1997
Springer
15 years 1 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
ISMIS
2005
Springer
15 years 3 months ago
The Chisholm Paradox and the Situation Calculus
Deontic logic is appropriate to model a wide variety of legal arguments, however this logic suffers form certain paradoxes of which the so-called Chisholm is one of the most notor...
Robert Demolombe, Maria del Pilar Pozos Parra
ATAL
2010
Springer
14 years 11 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor