Results 11  20
of
365,026
Resolution is a Decision Procedure for Many Propositional Modal Logics
, 1997
"... The paper shows satisfiability in many propositional modal systems can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satisfiability problem of formulae in socalled path logics. Path logics arise from p ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
The paper shows satisfiability in many propositional modal systems can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satisfiability problem of formulae in socalled path logics. Path logics arise from
Terminating Minimal Model Generation Procedures for Propositional Modal Logics?
"... Abstract. Model generation and minimal model generation are useful for tasks such as model checking and for debugging of logical specifications. This paper presents terminating procedures for the generation of models minimal modulo subsetsimulation for the modal logic K and all combinations of ext ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Model generation and minimal model generation are useful for tasks such as model checking and for debugging of logical specifications. This paper presents terminating procedures for the generation of models minimal modulo subsetsimulation for the modal logic K and all combinations
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
"... Abstract. We present a multicontext focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitionistic modal logic IS4. This calculus, suitable for the enumeration of normal proofs, is the starting point for ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We present a multicontext focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitionistic modal logic IS4. This calculus, suitable for the enumeration of normal proofs, is the starting point
A CutFree Sequential System for the Propositional Modal Logic of Finite Chains By
"... The main purpose of this paper is to give a cutfree Gentzentype sequential system for K4.3G of finite chains. The cutelimination theorem is proved both modeltheoretically and prooftheoretically. ..."
Abstract
 Add to MetaCart
The main purpose of this paper is to give a cutfree Gentzentype sequential system for K4.3G of finite chains. The cutelimination theorem is proved both modeltheoretically and prooftheoretically.
Determining the subset relation between propositional modal logics. http://kwarc.eecs.iubremen.de/frabe/Research/moloss
"... We present design and implementation of a system that tries to automatically determine the subset relation between two given axiomatizations of almost arbitrary propositional modal logics, which is an open challenge problem for automated theorem proving. A test suite shows that relatively simple st ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present design and implementation of a system that tries to automatically determine the subset relation between two given axiomatizations of almost arbitrary propositional modal logics, which is an open challenge problem for automated theorem proving. A test suite shows that relatively simple
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract

Cited by 579 (32 self)
 Add to MetaCart
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning
Optimising propositional modal satisfiability for description logic subsumption
 In Artificial Intelligence and Symbolic Computation: Int. Conf. AISCâ€™98, number 1476 in LNAI
, 1998
"... Abstract. Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the correspondence between description logics and propositional modal logic many of these techniques carry over into pr ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract. Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the correspondence between description logics and propositional modal logic many of these techniques carry over
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Results 11  20
of
365,026