Sciweavers

1466 search results - page 37 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
TOCL
2011
87views more  TOCL 2011»
14 years 10 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 3 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
COGSCI
2008
90views more  COGSCI 2008»
15 years 3 months ago
Using fMRI to Test Models of Complex Cognition
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...
John R. Anderson, Cameron S. Carter, Jon M. Fincha...
IJCAI
1993
15 years 5 months ago
A Metalogic Programming Approach to Reasoning about Time in Knowledge Bases
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Suryanarayana M. Sripada
EUROCAST
2005
Springer
84views Hardware» more  EUROCAST 2005»
15 years 9 months ago
A Tractable Subclass of Fuzzy Constraint Networks
The Fuzzy Constraint Networks model, a generalization of the Disjunctive Temporal Fuzzy Constraint Networks, is a framework that allows representing and reasoning with fuzzy qualit...
Alfonso Bosch, Francisco Guil, Roque Marín