150 search results - page 2 / 30 » Parameterized Modal Satisfiability |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
JOLLI
2002
13 years 5 months ago
2002
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
CORR
2008
Springer
13 years 6 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...
ENTCS
2010
13 years 3 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...