Results 1  10
of
3,897
A Prefixed Tableau Calculus for Plan Generation in Linear Temporal Logic
, 1997
"... The search for finite models of temporal logic specifications furnishes a logical, though nondeductive, approch to planning, that opens the way to the exploitation of methodologies and techniques from classical searchbased approaches, such as planspace search, regression and least commitment. In ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. In this paper a tableau based decision procedure for finite satisfiability of linear temporal formulae is presented. The method is based on prefixed tableaux, where a partial order on prefixes is built in each branch step by step. A form of soundness and completeness w.r.t. finite model construction
Tableaubased decision procedures for hybrid logic
 Journal of Logic and Computation
, 2005
"... Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is wellknown that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
procedures make use of socalled loopchecks which is a technique standardly used in connection with tableau systems for other logics, namely prefixed tableau systems for transitive modal logics, as well as prefixed tableau systems for certain description logics. The loopchecks used in our four decision
Normal Multimodal Logics With Interaction Axioms: A Tableau Calculus and Some (Un)Decidability Results
, 2000
"... In this paper we present a prefixed analytic tableau calculus for a wide class of normal multimodal logics; the calculus can deal in a uniform way with any logic in this class. To achieve this goal, we use a prefixed tableau calculus a la Fitting, where we explicitly represent accessibility relation ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
In this paper we present a prefixed analytic tableau calculus for a wide class of normal multimodal logics; the calculus can deal in a uniform way with any logic in this class. To achieve this goal, we use a prefixed tableau calculus a la Fitting, where we explicitly represent accessibility
Terminating tableau calculi for modal logic K with global counting operators
"... This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the sec ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus
A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results
 IN PROC. OF TABLEAUX98
, 1998
"... In this paper we present a prefixed analytic tableau calculus for a class of normal multimodal logics and we present some results about decidability and undecidability of this class. The class is characterized by axioms of the form [t 1 ] : : : [t n ]' oe [s1 ] : : : [sm ]', called incl ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
In this paper we present a prefixed analytic tableau calculus for a class of normal multimodal logics and we present some results about decidability and undecidability of this class. The class is characterized by axioms of the form [t 1 ] : : : [t n ]' oe [s1 ] : : : [sm ]', called
A simple tableau system for the logic of elsewhere
 177– 192. LNAI 1071
, 1996
"... Abstract. We analyze different features related to the mechanization of von Wright’s logic of elsewhere E. First, we give a new proof of the NPcompleteness of the satisfiability problem (giving a new bound for the size of models of the satisfiable formulae) and we show that this problem becomes lin ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
lineartime when the number of propositional variables is bounded. Although E and the wellknown propositional modal S5 share numerous common features we show that E is strictly more expressive than S5 (in a sense to be specified). Second, we present a prefixed tableau system for E and we prove both its
Automated Synthesis of Tableau Calculi
"... Abstract This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated rules ..."
Abstract

Cited by 12 (11 self)
 Add to MetaCart
Abstract This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated
Prefixed Tableaus and Nested Sequents
, 2010
"... Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tabl ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants of each other, roughly in the same way that tableaus and Gentzen sequent calculi
Tableaubased automata . . .
, 2003
"... We present a tableaubased algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction fo ..."
Abstract
 Add to MetaCart
We present a tableaubased algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction
A Tableau Calculus for Equilibrium Entailment
 In Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847
, 2000
"... We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics undery ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics
Results 1  10
of
3,897