91 search results - page 14 / 19 » The Complexity of Reasoning for Fragments of Default Logic |
78
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
CLIMA
2004
14 years 11 months ago
2004
Abstract. Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. It has been demonstrated [19] how symbolic negotiation and distr...
89
Voted
PODS
2010
ACM
14 years 9 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
DLOG
2008
14 years 12 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
81
Voted
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...