See this document in CiteSeerX!

Mechanised Reasoning and Model Generation for Extended Modal Logics (2003)  (Make Corrections)  (1 citation)
Renate A. Schmidt, Ullrich Hustadt



  Home/Search   Context   Related

 
View or download:
cs.man.ac.uk/~schm...dtHustadt03a.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.man.ac.uk/~schmidt/pub...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The approach presented in this overview paper exploits that modal logics can be seen to be fragments of first-order logic and deductive methods can be developed and studied within the framework of first-order resolution. We focus on a class of extended modal logics very similar in spirit to propositional dynamic logic and closely related to description logics. We review and discuss the development of decision procedures for decidable extended modal logics and look at methods for automatically... (Update)

Cited by:   More
A Principle for Incorporating Axioms into the First-Order.. - Schmidt, Hustadt (2004)   (Correct)

Similar documents (at the sentence level):   More
78.8%:   Mechanised Reasoning and Model Generation for Extended Modal.. - Schmidt, Hustadt (2003)   (Correct)
16.0%:   Resolution-Based Methods for Modal Logics - de Nivelle, SCHMIDT, al. (2000)   (Correct)
16.0%:   Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Optimising minimal Herbrand model generation procedures - Georgieva (2003)   (Correct)
1.0:   Implementing an Efficient Theorem Prover - Riazanov (2003)   (Correct)
0.9:   MSPASS: Modal Reasoning by Translation and First-Order.. - Hustadt, Schmidt (2000)   (Correct)

Similar documents based on text:   More   All
0.9:   A Resolution Decision Procedure for Fluted Logic - Schmidt, Hustadt (2000)   (Correct)
0.8:   Using Resolution for Testing Modal Satisfiability and.. - Hustadt, Schmidt (2000)   (Correct)
0.7:   Computational Space Efficiency and Minimal Model.. - Georgieva, Hustadt.. (2001)   (Correct)

BibTeX entry:   (Update)

R. A. Schmidt and U. Hustadt. Mechanised reasoning and model generation for extended modal logics. In Theory and Applications of Relational Structures as Knowledge Instruments, vol. 2929 of LNCS, pp. 38--67. Springer, 2003. http://citeseer.ist.psu.edu/article/schmidt03mechanised.html   More

@misc{ schmidt03mechanised,
  author = "R. Schmidt and U. Hustadt",
  title = "Mechanised reasoning and model generation for extended modal logics",
  text = "R. A. Schmidt and U. Hustadt. Mechanised reasoning and model generation
    for extended modal logics. In Theory and Applications of Relational Structures
    as Knowledge Instruments, vol. 2929 of LNCS, pp. 38--67. Springer, 2003.",
  year = "2003",
  url = "citeseer.ist.psu.edu/article/schmidt03mechanised.html" }
Citations (may not include all citations):
142   Rewrite-based equational theorem proving with selection and .. (context) - Bachmair, Ganzinger - 1994
94   A structure-preserving clause form translation (context) - Plaisted, Greenbaum - 1986
60   Semantics based translation methods for modal logics (context) - Ohlbach - 1991
53   A tableau calculus for minimal model reasoning - Niemela - 1996
52   Quantifier elimination in second-order predicate logic - Gabbay, Ohlbach - 1992
45   Translation methods for non-classical logics: An overview (context) - Ohlbach - 1993
42   Modal theorem proving: An equational viewpoint (context) - Au, Enjalbert - 1992
42   ciency of propositional proof systems (context) - Cook, Reckhow - 1979
42   A superposition decision procedure for the guarded fragment .. - Ganzinger, de Nivelle - 1999
40   the decision problem for two-variable first-order logic - Gradel, Kolaitis et al. - 1997
38   Completeness and correspondence in the first and second orde.. (context) - Sahlqvist - 1973
38   Resolution theorem proving - Bachmair, Ganzinger - 2001
32   Issues of decidability for description logics in the framewo.. - Hustadt, Schmidt - 2000
30   Computing circumscription revisited: A reduction algorithm - Doherty, Lukaszewicz et al. - 1997
29   Notre Dame Journal of Formal Logic (context) - Humberstone - 1983
28   Modal environment for Boolean speculations (context) - Gargov, Passy et al. - 1986
28   Relative Complexities of First Order Calculi (context) - Eder - 1992
24   The complexity of reasoning with boolean modal logics - Lutz, Sattler - 2002
24   Raisonnement automatique en logique modale et algorithmes d'.. (context) - Herzig - 1989
22   A note on Boolean modal logic (context) - Gargov, Passy - 1988
21   First-order modal logic theorem proving and functional simul.. (context) - Nonnengart - 1993
21   Decidability by resolution for propositional modal logics (context) - Schmidt - 1999
20   Functional translation and second-order frame properties of .. - Ohlbach, Schmidt - 1997
20   Resolution decision procedures (context) - Fermuller, Leitsch et al. - 2001
20   Soft typing for ordered resolution - Ganzinger, Meyer et al. - 1997
20   FaCT and DLP - Horrocks, Patel-Schneider - 1998
20   Encoding two-valued nonclassical logics in classical logic (context) - Ohlbach, Nonnengart et al. - 2001
19   Normal multimodal logics (context) - Catach - 1988
19   An empirical analysis of modal theorem provers - Hustadt, Schmidt - 1999
18   the relation of resolution and tableaux proof systems for de.. - Hustadt, Schmidt - 1999
17   Superposition with simplification as a decision procedure fo.. (context) - Bachmair, Ganzinger et al. - 1993
17   A resolution-based decision procedure for extensions of K - Ganzinger, Hustadt et al. - 2001
16   Maslov's class K revisited - Hustadt, Schmidt - 1999
14   An optimality result for clause form translation (context) - de la - 1992
14   Resolution-based methods for modal logics - de Nivelle, Schmidt et al. - 2000
14   Resolution-Based Decision Procedures for Subclasses of First.. (context) - Hustadt - 1999
13   ary description logic (context) - Lutz, Sattler et al. - 1999
13   Combining Hilbert style and semantic reasoning in a resoluti.. - Ohlbach - 1998
12   The Logics Workbench LWB: A snapshot (context) - Heuerding, Jager et al. - 1996
12   The Saturate system - Ganzinger, Nieuwenhuis - 1994
12   Hyperresolution for guarded formulae - Georgieva, Hustadt et al. - 2004
11   System Abstract: E (context) - Schulz - 1999
11   Information Processing Letters (context) - Passy, Tinchev et al. - 1985
11   Merge path improvements for minimal model hyper tableaux - Baumgartner, Horton et al. - 1999
11   A Brainiac theorem prover (context) - Schulz - 2002
10   Splitting without backtracking (context) - Riazanov, Voronkov - 2001
9   On generating small clause normal forms - Nonnengart, Rock et al. - 1998
9   Positive unit hyperresolution tableaux for minimal model gen.. - Bry, Yahya - 2000
9   all and only (context) - Humberstone, logic - 1987
8   translation based decision procedures for modal logics: A co.. (context) - Giunchiglia, Giunchiglia et al. - 2000
8   EATCS Texts in Theoretical Computer Science (context) - Leitsch, Calculus - 1997
8   sorts and splitting (context) - Weidenbach - 1965
8   Using resolution for testing modal satisfiability and buildi.. - Hustadt, Schmidt - 2002
7   A new clausal class decidable by hyperresolution - Georgieva, Hustadt et al. - 2002
7   A new clausal class decidable by hyperresolution - Georgieva, Hustadt et al. - 2002
7   Optimised functional translation and resolution - Hustadt, Schmidt et al. - 1998
7   MSPASS: Modal reasoning by translation and first-order resol.. - Hustadt, Schmidt - 2000
7   Simplification and backjumping in modal tableau - Hustadt, Schmidt - 1998
7   A resolution decision procedure for fluted logic - Schmidt, Hustadt - 2000
6   ciency and minimal model generation for guarded formulae (context) - Georgieva, Hustadt et al. - 2001
6   volume 679 of Lecture Notes in Computer Science (context) - Fermuller, Leitsch et al. - 1993
6   Single step tableaux for modal logics: Computational propert.. - Massacci - 2000
5   An implementation and optimization of an algorithm for reduc.. - Gustafsson - 1996
5   mpi-sb (context) - Weidenbach, http - 1999
4   Normal multimodal logics with interaction axioms - Baldoni - 2000
4   Quantifier elimination for second-order predicate logic (context) - Nonnengart, Ohlbach et al.
3   cient minimal model generation using branching lemmas (context) - Hasegawa, Fujita et al. - 2000
3   Splitting through new proposition symbols (context) - de Nivelle - 2001
2   the relationship between decidable fragments (context) - Georgieva, Hustadt et al. - 2002
2   Quantifier elimination in second-order predicate logic (context) - Engel - 1996
2   The Otter theorem prover (context) - McCune - 1995
2   Deciding the guarded frgament by resolution (context) - de Nivelle, de Rijke - 1999
1   Soviet Mathematics (context) - Zamov - 1989
1   of Boolean algebras with operators and logics extending lamb.. (context) - Kurucz, Nemeti et al. - 1993
http://www.cs.man.ac.uk/~schmidt/mspass/

Documents on the same site (http://www.cs.man.ac.uk/~schmidt/publications/index.html):   More
Hyperresolution for Guarded Formulae - Georgieva, Hustadt, Schmidt (2000)   (Correct)
A Resolution-Based Decision Procedure for Extensions of K4 - Ganzinger, Hustadt.. (1998)   (Correct)
Maslov's Class K Revisited - Hustadt, Schmidt (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC