Sciweavers

2067 search results - page 33 / 414
» Logics of propositional control
Sort
View
FOSSACS
2007
Springer
15 years 10 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
APAL
2008
80views more  APAL 2008»
15 years 6 months ago
A quantified logic of evidence
A propositional logic of explicit proofs, LP, was introduced in [2], completing a project begun long ago by G
Melvin Fitting
RELMICS
2000
Springer
15 years 9 months ago
Implication-with-possible-exceptions
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
Nerman Jurrjus, Harrie C. M. de Swart
FORMATS
2004
Springer
15 years 10 months ago
Some Progress in Satisfiability Checking for Difference Logic
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
Scott Cotton, Eugene Asarin, Oded Maler, Peter Nie...
JSYML
2007
88views more  JSYML 2007»
15 years 6 months ago
The basic intuitionistic logic of proofs
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
Sergei N. Artëmov, Rosalie Iemhoff