Sciweavers

2022 search results - page 6 / 405
» Complexity of Non-Monotonic Logics
Sort
View
FROCOS
2009
Springer
14 years 5 months ago
Taming the Complexity of Temporal Epistemic Reasoning
Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent s...
Clare Dixon, Michael Fisher, Boris Konev
FSTTCS
2010
Springer
13 years 8 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
FUIN
2010
98views more  FUIN 2010»
13 years 8 months ago
On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
CSL
2005
Springer
14 years 4 months ago
The Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...
Julian C. Bradfield, Stephan Kreutzer
IJAR
2008
108views more  IJAR 2008»
13 years 11 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson