2067 search results - page 33 / 414 » Logics of propositional control |
137
click to vote
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
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...
105
click to vote
APAL
2008
15 years 1 months ago
2008
A propositional logic of explicit proofs, LP, was introduced in [2], completing a project begun long ago by G
102
click to vote
RELMICS
2000
Springer
15 years 5 months ago
2000
Springer
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...
105
click to vote
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
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...
104
click to vote
JSYML
2007
15 years 1 months ago
2007
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 ...