Sciweavers

148 search results - page 10 / 30
» On the Complexity of Elementary Modal Logics
Sort
View
LICS
1994
IEEE
15 years 3 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
86
Voted
AAAI
2007
15 years 2 months ago
Prime Implicates and Prime Implicants in Modal Logic
The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic K. We consider a number of different potential definitions of...
Meghyn Bienvenu
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 11 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
CORR
2010
Springer
202views Education» more  CORR 2010»
14 years 11 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
ACL
1992
15 years 26 days ago
Information States as First Class Citizens
The information state of an agent is changed when a text (in natural language) is processed. The meaning of a text can be taken to be this information state change potential. The ...
Jørgen Villadsen