Results 1  10
of
142,923
Generalized Modal Satisfiability
, 2005
"... It is wellknown that modal satisfiability is PSPACEcomplete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We co ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
It is wellknown that modal satisfiability is PSPACEcomplete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We
Generalized Modal Satisfiability ⋆
, 804
"... Abstract. It is well known that modal satisfiability is PSPACEcomplete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean functio ..."
Abstract
 Add to MetaCart
Abstract. It is well known that modal satisfiability is PSPACEcomplete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean
Parameterized Modal Satisfiability
"... Abstract. We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem’s combinatorial explosion, beyond the number of propositional variables v. To this end we study the modalit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem’s combinatorial explosion, beyond the number of propositional variables v. To this end we study
Constraint Methods for Modal Satisfiability
"... Modal and modallike formalisms such as temporal or description logics go beyond propositional logic by introducing operators that allow for a guarded form of quantification over states or paths of transition systems. Thus, they are more expressive than propositional logic, yet computationally bett ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
better behaved than firstorder logic. We propose constraintbased methods to model and solve modal satisfiability problems. We model the satisfiability of basic modal formulas via appropriate sets of finite constraint satisfaction problems, and then resolve these via constraint solvers. The domains
Structured Problems for Modal Satisfiability Testing
"... We report on ongoing experimental work on evaluating test sets for testing modal satisfiability solvers. Our longterm aim is to understand the difference between the use of structured and of unstructured randomly generated problems. Which parts of the problem space do they explore? ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We report on ongoing experimental work on evaluating test sets for testing modal satisfiability solvers. Our longterm aim is to understand the difference between the use of structured and of unstructured randomly generated problems. Which parts of the problem space do they explore?
Finite CSP Solvers for Modal Satisfiability
 In Proceedings M4M3
, 2003
"... We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speeding up ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speeding
Modal Satisfiability via SMT Solving?
"... Abstract. Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT and SM ..."
Abstract
 Add to MetaCart
Abstract. Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT
A Does Treewidth Help in Modal Satisfiability?
"... Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence g ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
graph for modal logic formulas in a certain normal form. We investigate the parameterized complexity of modal satisfiability with the modal depth of the formula and the treewidth of the incidence graph as parameters. For various combinations of Euclidean, reflexive, symmetric and transitive models, we
Modelling Modal Satisfiability in Constraint Logic Programming
, 2003
"... We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speedin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal
Constraint Programming for Modelling and Solving Modal Satisfiability
, 2003
"... We explore to what extent and how e#ciently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with nonboolean domains, together with suitable constraints. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We explore to what extent and how e#ciently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with nonboolean domains, together with suitable constraints.
Results 1  10
of
142,923