Results 1  10
of
45
An analysis of empirical testing for modal decision procedures
 LOGIC JOURNAL OF THE IGPL
"... Recent years have seen the emergence of a new generation of heavilyoptimised modal decision procedures. Several systems based on such procedures are now available and have proved to be much more effective than the previous generation of modal decision procedures. As both computational complexity an ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
Recent years have seen the emergence of a new generation of heavilyoptimised modal decision procedures. Several systems based on such procedures are now available and have proved to be much more effective than the previous generation of modal decision procedures. As both computational complexity and algorithm complexity are generally unchanged, neither is useful in analysing and comparing these new systems and their various optimisations. Instead, empirical testing has been widely used, both for comparison and as a tool for tuning systems and identifying their strengths and weaknesses. However, the very effectiveness of the new systems has revealed serious weaknesses in existing empirical test suites and methodologies. This paper provides a detailed survey of empirical testing methodologies, analyses the current state of the art and presents new results obtained with a recently developed test method.
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 25 (8 self)
 Add to MetaCart
(Show Context)
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 inclusion axioms, where the t i 's and s j 's are constants. This class of logics, called grammar logics, was introduced for the first time by Farinas del Cerro and Penttonen to simulate the behaviour of grammars in modal logics, and includes some wellknown modal systems. The prefixed tableau method is used to prove the undecidability of modal systems based on unrestricted, context sensitive, and context free grammars. Moreover, we show that the class of modal logics, based on rightregular grammars, are decidable by means of the filtration methods, by defining an extension of the FischerLadner closure.
Connectionbased Theorem Proving in Classical and Nonclassical Logics
 Journal of Universal Computer Science
, 1999
"... Abstract: We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic ..."
Abstract

Cited by 24 (15 self)
 Add to MetaCart
(Show Context)
Abstract: We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development of proofs in interactive proof assistants and shows how to integrate automated and interactive theorem proving. 1
A Sequent Calculus and a Theorem Prover for Standard Conditional Logics
, 2007
"... ..."
(Show Context)
Reasoning about Security: a Logic and a Decision Method for RoleBased Access Control
 In ECSQARUFAPR
, 1997
"... . Rolebased access control (RBAC) is one of the most promising techniques for the design and implementation of security policies and its diffusion may be enhanced by the development of formal and automated method of analysis. This paper presents a logic for practical reasoning about role based acce ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
(Show Context)
. Rolebased access control (RBAC) is one of the most promising techniques for the design and implementation of security policies and its diffusion may be enhanced by the development of formal and automated method of analysis. This paper presents a logic for practical reasoning about role based access control which simplifies and adapts to RBAC the calculus developed at Digital SRC. Beside a language and a formal semantics, a decision method based on analytic tableaux is also given. Analytic tableaux make it possible to reason about logical consequence, model generation and consistency of a formalised rolebased security policy. 1 Introduction Access control is a key issue for the security of distributed systems (see [28] for an introduction) and plays an important role in the security policies of many organisations such as the military [4], banking [7] or health services [2]. Recently, new formal models for access control have emerged besides the traditional access matrix [21] for th...
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 relations between worlds by means of a graph and we use the characterizing axioms as rewriting rules. Such rules create new paths among worlds in the countermodel construction. The prefixed tableau method is, then, used to prove (un)decidability results about certain classes of multimodal logics.
linTAP: A Tableau Prover for Linear Logic
 International Conference TABLEAUX’99
, 1999
"... linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an analytic tableau and ensures the linear validity using prex unication. We present the tableau calculus used by linTAP, an algorithm fo ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
(Show Context)
linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an analytic tableau and ensures the linear validity using prex unication. We present the tableau calculus used by linTAP, an algorithm for prex unication in linear logic, the linTAP implementation, and some experimental results obtained with linTAP. 1
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
, 1999
"... . We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restrict ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
(Show Context)
. We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cutrule that is not eliminable. A nice computational property of the restriction is, for instance, that at any stage of the proof, only a finite number of potential cutformulae needs to be taken under consideration. Although restrictions on the proof search (preserving completeness) are given in the paper and most of them are theoretically appealing, the use of those calculi for mechanization is however doubtful. Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics. 1 Introduction Background. The nominal tense logics are extensions of Prior tense logics (see e.g. [Pri57, RU71]) by adding nomina...
A New General Method To Generate Random Modal Formulae For Testing Decision Procedures
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2003
"... The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To c ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
The recent emergence of heavilyoptimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To cope with this fact, we present a new random generation method that provides benefits over previous methods for generating empirical tests. It fixes and much generalizes one of the bestknown methods, the random CNF test, allowing for generating a much wider variety of problems, covering in principle the whole input space. Our new method produces much more suitable test sets for the current generation of modal decision procedures. We analyze the features of the new method by means of an extensive collection of empirical tests.
G.L.: CondLean: A Theorem Prover for Conditional Logics
 Tableaux 2003. LNAI
, 2003
"... Abstract. In this paper we present CondLean, a theorem prover for ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we present CondLean, a theorem prover for