Filters








7,787 Hits in 7.7 sec

Modal vs. Propositional Reasoning for model checking with Description Logics

Shoham Ben-David, Richard J. Trefler, Grant E. Weddell
2007 International Workshop on Description Logics  
Acknowledgements We thank Dmitry Tsarkov for his support in the installation of FaCT++, and Peter Tarle and Nortel for many valuable discussions on this work and for financial support.  ...  Bounded Model Checking Using Description Logic Reasoning We briefly describe how bounded model checking can be achieved using description logic reasoning.  ...  Such an assignment, if found, demonstrates an error in the model. We investigate the possibility of using a Description Logic reasoner for bounded model checking.  ... 
dblp:conf/dlog/Ben-DavidTW07 fatcat:wyk4v5n2ibhvnd7mnnvbkgunpa

From Description to Hybrid Logics, and Back [chapter]

CARLOS ARECES, MAARTEN DE RIJKE
2002 Advances in Modal Logic  
Improving on work by Schild, De Giacomo and Lenzerini, we establish a tight connection between description logics and hybrid logics, and use this to transfer results on complexity and expressive power  ...  Maarten de Rijke was supported by the Spinoza project 'Logic in Action' and by a grant from the Netherlands Organization for Scientific Research (NWO), under project number 365-20-005.  ...  We would like to thank the anonymous referees for their valuable comments.  ... 
doi:10.1142/9789812776471_0002 dblp:conf/aiml/ArecesR00 fatcat:gjwz7k2vlje7vezzmueyczmrra

A Solver for Modal Fixpoint Logics

Oliver Friedmann, Martin Lange
2010 Electronical Notes in Theoretical Computer Science  
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics.  ...  MLSolver is designed to allow easy extensions in the form of further modal fixpoint logics.  ...  It provides a framework for satisfiability and validity checking for various 1 modal fixpoint logics. It can also be used as a model checker for these logics.  ... 
doi:10.1016/j.entcs.2010.04.008 fatcat:lkcg5djjnzc3rjf6xdp4t3tfli

Logics for Dependence and Independence (Dagstuhl Seminar 15261)

Erich Grädel, Juha Kontinen, Jouka Väänänen, Heribert Vollmer, Marc Herbstritt
2016 Dagstuhl Reports  
This report documents the programme and outcomes of Dagstuhl Seminar 15261 'Logics for Dependence and Independence'.  ...  This seminar served as a follow-up seminar to the highly successful seminar 'Dependence Logic: Theory and Applications' (Dagstuhl Seminar 13071).  ...  Complexity of Propositional Inclusion and Independence Logic We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence and inclusion  ... 
doi:10.4230/dagrep.5.6.70 dblp:journals/dagstuhl-reports/GradelKVV15 fatcat:wqkpzm2ywbcjdke2zyvvw4dlny

A Modal Perspective on Path Constraints

N. Alechina
2003 Journal of Logic and Computation  
Proofs are based on techniques from modal logic and automata theory. This modal logic perspective sheds additional light on the reasons for previously known decidability and complexity results.  ...  Several classes of path constraints for semistructured data are analysed and a number of decidability and complexity results proved for such constraints.  ...  Acknowledgements We are grateful to Ulrike Sattler and the anonymous referees for useful comments. We are especially grateful to Philippe Schnoebelen, who gave us the proof for Lemma 5.1.  ... 
doi:10.1093/logcom/13.6.939 fatcat:hjkl4vpesne4npdubj7wcgu2ii

A proof assistant for symbolic model-checking [chapter]

J. C. Bradfield
1993 Lecture Notes in Computer Science  
The tool has a general tableau-manager module, and may use different reasoning modules for different models of systems; a module for Petri nets has been implemented. -= [{al,...  ...  It also provides help with checking the well-foundedness conditions required to prove liveness properties.  ...  The modal mu-calculus The temporal logic we use is the propositional modal mu-calculus, introduced by Kozen [Koz83] .  ... 
doi:10.1007/3-540-56496-9_25 fatcat:z33vuw456jcd3kpalg5e4ete2a

On Expressive and Model Checking Power of Propositional Program Logics [chapter]

Nikolai V. Shilov, Kwang Yi
2001 Lecture Notes in Computer Science  
We examine when a model checker for a propositional program logic can be used for checking another propositional program logic in spite of lack of expressive power of the first logic.  ...  Rabin (S(n)S-Logic ), but still enjoys equal model checking power with CTL, µC and 2M (in the same settings as above).  ...  In contrast, we exploit games with terminal positions (basically, finite games) for forcing model checkers for CTL to check more expressive logics µC , 2M, and SOEPDL.  ... 
doi:10.1007/3-540-45575-2_6 fatcat:qzfkepswfjgoviq7kb3vgq5s74

THE LOGIC OF JUSTIFICATION

SERGEI ARTEMOV
2008 The Review of Symbolic Logic  
There are several good reasons for choosing the Boolean logic base here.  ...  We describe a general logical framework, Justification Logic, for reasoning about epistemic justification.  ...  Many thanks to Karen Kletter for editing this text.  ... 
doi:10.1017/s1755020308090060 fatcat:hsya3io3c5erff3yxi3vedlz3m

SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation

Enrico Giunchiglia, Roberto Sebastiani, Fausto Giunchiglia, Armando Tacchella
2000 Journal of Applied Non-Classical Logics  
This paper follows on previous papers which present and evaluate various decision procedures for modal logics.  ...  It also con rms previous evidence of an easy-hard-easy pattern in the satis ability curve for modal K.  ...  Finally, we thank the MRG group at Genova for putting up with many weeks of time-consuming tests.  ... 
doi:10.1080/11663081.2000.10510994 fatcat:4ckuipcj4zbtvm5j5raa5iqnki

Symbolic Decision Procedures for QBF [chapter]

Guoqiang Pan, Moshe Y. Vardi
2004 Lecture Notes in Computer Science  
We show that QBDD is not competitive, but QMRES compares favorably with search-based solvers on various benchmarks consisting of non-random formulas.  ...  We extend some recent symbolic approaches for SAT solving to symbolic QBF solving, using various decision-diagram formalisms such as OBDDs and ZDDs.  ...  Acknowledgement We would like to thank Laurent Simon for making available to us his ZRes package, which served as the basis for QMRES.  ... 
doi:10.1007/978-3-540-30201-8_34 fatcat:qh6tulx5mrelfj2cm6abw5qkty

Deontic Logic for Human Reasoning [article]

Ulrich Furbach, Claudia Schon
2014 arXiv   pre-print
Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail.  ...  Furthermore it is shown that an automated theorem prover can be used as a reasoning tool for deontic logic.  ...  Deontic Logic as Modal KD Deontic logic is a well studied modal logic very suitable to model human reasoning.  ... 
arXiv:1404.6974v2 fatcat:ztt3w757ezhljh46keruuv4ily

Action versus state based logics for transition systems [chapter]

Rocco Nicola, Frits Vaandrager
1990 Lecture Notes in Computer Science  
This new logic for transition systems can play an important role as an intermediate between Hennessy-Milner Logic and the modal µ-calculus.  ...  It is sufficiently expressive to describe safety and liveness properties but permits model checking in linear time.  ...  However, since model checking for CTL *is in PSPACE [EL87] , and because of our polynomial reduction of model checking for CTL * to model checking for ACTL *, this means that model checking for ACTL *  ... 
doi:10.1007/3-540-53479-2_17 fatcat:4tq5qtx5jfhd5gsot6mnvgbmcm

B Maude: A formal executable environment for Abstract Machine Notation Descriptions [article]

Christiano Braga, Narciso Martí-Oliet
2021 arXiv   pre-print
B Maude endows the B method with execution by rewriting, symbolic search with narrowing and Linear Temporal Logic model checking of AMN descriptions.  ...  We propose B Maude, a prototype executable environment for the Abstract Machine Notation implemented in the Maude language.  ...  The standard models for Modal Logics (e.g.  ... 
arXiv:2108.07878v1 fatcat:k6th3pifzzecbkk3ux62e5m4yq

Computing Minimal Models Modulo Subset-Simulation for Modal Logics [chapter]

Fabio Papacchini, Renate A. Schmidt
2013 Lecture Notes in Computer Science  
We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K (m) , and we discuss extensions to cover more expressive  ...  In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation.  ...  Preliminaries We work with modal formulae of propositional multi-modal logic K (m) possibly extended with universal modalities or a subset of the well-known axioms T, B, D, 4, and 5.  ... 
doi:10.1007/978-3-642-40885-4_20 fatcat:bw6ci7m2d5hwxm3rugj4tyvu24

Revisionary and Descriptive Metaphysics

Markku KEINÄNEN
2008 Philosophica  
In the first part of this article, I criticize two popular ways to study the categorial structure, Strong and Weak Modelling.  ...  The systematic description of the different kinds of entities assumed by our commonsense conceptions (Descriptive Metaphysics) forms a starting-point of the study of the categorial structure of the world  ...  A Lewisian modal realist can retreat from full-blown Weak Modelling, which provides an ontological correlative for any true proposition.  ... 
doi:10.21825/philosophica.82172 fatcat:ehct4lo64vfqvdk33oypw65lha
« Previous Showing results 1 — 15 out of 7,787 results