2214 search results - page 95 / 443 » Complexity of Reasoning |
98
Voted
IJCAI
2003
15 years 4 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
168
Voted
LICS
2012
IEEE
13 years 5 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
107
click to vote
IEAAIE
1999
Springer
15 years 7 months ago
1999
Springer
This paper describes the use of cases as a process representation technique and shows how case base reasoning can be used to navigate through, or execute a complex control process....
148
click to vote
ESSLLI
2009
Springer
15 years 1 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
109
click to vote
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...