CORR
2008
Springer
13 years 5 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
ACL
2000
13 years 6 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
DLT
2004
13 years 6 months ago
2004
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...
AIML
2004
13 years 6 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
CAV
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
STACS
2000
Springer
13 years 8 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
CP
2000
Springer
13 years 8 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
AUSAI
2003
Springer
13 years 8 months ago
2003
Springer
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
ECAI
2004
Springer
13 years 8 months ago
2004
Springer
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...