See this document in CiteSeerX!

Building decision procedures for modal logics from propositional decision procedures the case study of modal K (1996)  (Make Corrections)  (92 citations)
Fausto Giunchiglia, Roberto Sebastiani
Conference on Automated Deduction



  Home/Search   Context   Related

 
View or download:
cs.unitn.it/~rseba/paper...cade96.ps.gz
fandango.cs.unitn.it/~rs...cade96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mrg.cs.unitn.it/~rseba/publist (more)
(Enter author homepages)

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

Abstract: . The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we describe an algorithm, based on an implementation of the Davis-PutnamLongemann -Loveland procedure, which tests satisfiability in modal K. The algorithm is compared with a tableau based decision procedure. The experimental... (Update)

Cited by:   More
Algebraic Simplification Techniques For Propositional.. - de Faria (2001)   (Correct)
Sat-Based Decision Procedures For Automated Reasoning: A.. - Armando, Al. (2002)   (Correct)
Constraint Programming for Modelling and Solving Modal.. - Brand, Gennari, Rijke (2003)   (Correct)

Similar documents (at the sentence level):
17.6%:   Building decision procedures for modal logics from.. - Giunchiglia, Sebastiani (1996)   (Correct)

Active bibliography (related documents):   More   All
0.3:   A SAT-based decision procedure for ALC - Giunchiglia, Sebastiani (1996)   (Correct)
0.2:   A New Method for Testing Decision Procedures in Modal .. - Giunchiglia, Roveri, .. (1996)   (Correct)
0.2:   Parallel Symbolic Computing with the Shared Dataspace.. - Ciancarini, Gaspari (1994)   (Correct)

Similar documents based on text:   More   All
0.4:   SAT vs. Translation Based decision procedures for.. - Giunchiglia.. (1998)   (Correct)
0.3:   More Evaluation of Decision Procedures for Modal Logics - Giunchiglia, Giunchiglia, .. (1998)   (Correct)
0.3:   Tactics: Extending the Notion of Plan - Giunchiglia, Traverso   (Correct)

Related documents from co-citation:   More   All
39:   On Evaluating Decision Procedures for Modal Logic - Hustadt, Schmidt - 1997
36:   A machine program for theoremproving (context) - Davis, Logemann et al. - 1962
29:   A SAT-based decision procedure for ALC - Giunchiglia, Sebastiani - 1996

BibTeX entry:   (Update)

F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures: Case study of modal K. In M. A. McRobbie and J. K. Slaney, editors, Proc. of the 13th Intern. Conf. on Automated Deduction (CADE-13), LNAI 1104, pages 583--597. Springer, 1996. http://citeseer.ist.psu.edu/article/giunchiglia96building.html   More

@inproceedings{ giunchiglia96building,
    author = "Fausto Giunchiglia and Roberto Sebastiani",
    title = "Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K",
    booktitle = "Conference on Automated Deduction",
    pages = "583-597",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/giunchiglia96building.html" }
Citations (may not include all citations):
416   A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
390   A machine program for theorem proving (context) - Davis, Longemann et al. - 1962
320   Hard and Easy Distributions of SAT Problems - Mitchell, Selman et al. - 1992
240   A guide to the completeness and complexity for modal logics .. (context) - Halpern, Moses - 1992
207   Attributive Concept Descriptions with Complements (context) - Schmidt-Schauss, Smolka - 1991
176   A correspondence theory for terminological logics: prelimina.. - Schild - 1991
113   or: how we can do without modal logics (context) - Giunchiglia, Serafini et al. - 1994
93   Journal of Artificial Intelligence Research (context) - Ginsberg - 1993
88   Subsumption Algorithms for Concept Description Languages - Hollunder, Nutt et al. - 1990
62   First-Order Modal Tableaux (context) - Fitting - 1988
53   Strongly analytic tableaux for normal modal logics - Massacci - 1994
51   Report on a SAT competition - Buro, Buning - 1992
46   NonOmniscient Belief as Context-Based Reasoning (context) - Giunchiglia, Serafini et al. - 1993
41   Journal of Logic and Computation (context) - D'Agostino, Mondadori et al. - 1994
33   Are Tableaux an Improvement on Truth-Tables (context) - D'Agostino - 1992
24   Ordered Binary Decision Diagrams and the Davis-Putnam Proced.. - Uribe, Stickel - 1994
23   Embedding Complex Decision Procedures inside an Interactive .. (context) - Armando, Giunchiglia - 1993
17   Applying GSAT to Non-Clausal Formulas - Sebastiani - 1994
10   Symbolic Boolean manipolation with ordered binary-decision d.. (context) - Bryant - 1992
4   Technical Report TR (context) - Suttner, Sutcliffe et al. - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://mrg.cs.unitn.it/~rseba/publist.html):   More
New upper bounds for satisfiability in modal logics -- the.. - Roberto Sebastiani (1997)   (Correct)
Computing Abstraction Hierarchies by Numerical Simulation - Bundy, Giunchiglia.. (1996)   (Correct)
Formal Specification and Validation of a Vital.. - Cimatti..   (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