Sciweavers

827 search results - page 38 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
AAAI
1996
13 years 9 months ago
On the Size of Reactive Plans
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...
Peter Jonsson, Christer Bäckström
CADE
2009
Springer
14 years 8 months ago
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
Florian Widmann, Rajeev Goré
LICS
2008
IEEE
14 years 2 months ago
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
Taolue Chen, Wan Fokkink
IFM
2005
Springer
14 years 1 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
CSL
1997
Springer
13 years 12 months ago
From Action Calculi to Linear Logic
Abstract. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a type-theoretic account of action calculi using the proposi...
Andrew Barber, Philippa Gardner, Masahito Hasegawa...