725 search results - page 7 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
165
click to vote
CONCUR
2001
Springer
15 years 9 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
154
click to vote
FOSSACS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
175
click to vote
FOSSACS
2007
Springer
15 years 9 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...
150
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
197
click to vote
STACS
1993
Springer
15 years 9 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...