## A SAT-Based Decision Procedure for ALC (1996)

### Cached

### Download Links

- []
- [fandango.cs.unitn.it]
- [www.cs.man.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 57 - 16 self |

### BibTeX

@MISC{Giunchiglia96asat-based,

author = {Fausto Giunchiglia and Roberto Sebastiani},

title = {A SAT-Based Decision Procedure for ALC},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

References

### Citations

1072 | A computing procedure for quantification theory - Davis, Putnam - 1960 |

739 | A machine program for theorem proving - Davis, Logemann, et al. - 1962 |

577 | Where the Really Hard Problems Are - Cheeseman, Kenefsky, et al. - 1991 |

361 | A guide to completeness and complexity for modal logics of knowledge and belief - Halpern, Y, et al. - 1992 |

283 | and easy distributions of sat problems - Hard - 1992 |

272 | Proof methods for modal and intuitionistic logics - Fitting - 1983 |

255 | A correspondence theory for terminological logics: Preliminary report
- Schild
- 1991
(Show Context)
Citation Context ...olka 1991), comprising Boolean operations on concepts and value restrictions, and not restricted to CNF form. 1 As it is well known, ALC is a notational variant of K(m), that is, K with m modalities (=-=Schild 1991-=-). 2 The main idea underlying the definition of Ksat is that a decision procedure for satisfiability in K(m) 1 Ksat, the test code and all the results presented in this paper are available via anonymo... |

199 | Experimental results on the cross-over point in satisfiability problems - Crawford, Auton - 1993 |

185 | The computational complexity of provability in systems of modal propositional logic - Ladner - 1977 |

177 | Multilanguage Hierarchical Logics (or: How We Can Do Without Modal Logics - Giunchiglia, Serafini - 1994 |

147 | Attributive concept descriptions with complements - Schmidt-Schau��, Smolka - 1991 |

140 | An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on - Baader, Franconi, et al. - 1994 |

95 | Building decision procedures for modal logics from propositional decision procedures - the case study of modal K(m - Giunchiglia, Sebastiani - 1996 |

83 | Subsumption algorithms for concept description languages
- Hollunder, Nu�, et al.
- 1990
(Show Context)
Citation Context ...rward implementation of the algorithm described in (Hollunder, Nutt & Schmidt-Schau 1990). This procedure is called Tableau from now on. 4 The second is the state-of-the-art system Kris described in (=-=Hollunder et al. 1990, Baader, -=-Franconi, Hollunder, Nebel & Profitlich 1994). 5 There are many reasons why a system can be more efficient than another. A crucial one is the "smartness" of the implementation. The implement... |

78 | Report on a sat competition - Buro, Buning - 1992 |

72 | Exploiting the deep structure of constraint problems - Williams, Hogg - 1994 |

49 | The taming of the cut - D’Agostino, Mondadori - 1994 |

48 | Strongly analytic tableaux for normal modal logics
- Massacci
- 1994
(Show Context)
Citation Context ... (we think) non normal logics, following the methodology and results presented in (Giunchiglia & Serafini 1994, Giunchiglia, Serafini, Giunchiglia & Frixione 1993) (but see also, e.g., (Fitting 1983, =-=Massacci 1994-=-)). 4 Tableau is available via anonymous FTP at ftp.mrg.dist.unige.it in pub/mrg-systems/tableau. 5 Kris is available via anonymous FTP at ftp.dfki.uni-sb.de in /pub/tacos/KRIS. The paper is structure... |

44 | Ordered binary decision diagrams and the Davis-Putnam procedure - Uribe, Stickel - 1994 |

42 | Non-Omniscient Belief as Context-Based Reasoning - Giunchiglia, Serafini, et al. - 1993 |

37 | Implementing the DavisPutnam algorithm by tries - Zhang, Stickel - 1994 |

30 | Embedding Complex Decision Procedures Inside an Interactive Theorem Prover - Armando, Giunchiglia - 1993 |

30 | Critical Behaviour in the satisfiability of random Boolean expressions, Science 264 - Kirkpatrick, Selman - 1297 |

29 |
Are tableaux an improvement on truth-tables
- D’Agostino
- 1992
(Show Context)
Citation Context ...nd of the other rules for f:; :; oe; : oe; ::g. Analytic propositional tableaux perform what we call syntacticsbranching, that is, a branching on the syntactic structure of '. As widely discussed in (=-=D'Agostino 1992-=-, D'Agostino & Mondadori 1994), any application of the -rule generates two subtrees which are not mutually inconsistent , 10 that is, two subtrees which may share propositional models. The set of trut... |

19 | Applying GSAT to non-clausal formulas
- Sebastiani
- 1994
(Show Context)
Citation Context ...important to notice that KsatW is a variant of the 8 A notion of unit clause for non-CNF propositional wffs is given in (Armando & Giunchiglia 1993). More generally, (Armando & Giunchiglia 1993) and (=-=Sebastiani 1994-=-) show how decision procedures for CNF formulas can be modified to work for non-CNF formulas non-CNF version of the Davis-Putnam-LongemannLoveland SAT procedure (Davis & Putnam 1960, Davis, Longemann ... |

10 |
Symbolic Boolean manipolation with ordered binarydecision diagrams
- Bryant
- 1992
(Show Context)
Citation Context ...t 1 (left column) we 11 In Ksat we used non-CNF DPLL, but we could use any other SAT procedures not affected by the problem highlighted in (D'Agostino 1992, D'Agostino & Mondadori 1994), e.g., OBDDs (=-=Bryant 1992-=-), or an implementation of KE (D'Agostino & Mondadori 1994). fix d = 2, m = 1, p = 0:5 and plot different curves for increasing numbers of variables N = 3; 4; 5. 12 In Experiment 2 (center column) we ... |

9 |
Proof Methods for Modal and
- Fitting
- 1983
(Show Context)
Citation Context ...her normal and (we think) non normal logics, following the methodology and results presented in (Giunchiglia & Serafini 1994, Giunchiglia, Serafini, Giunchiglia & Frixione 1993) (but see also, e.g., (=-=Fitting 1983-=-, Massacci 1994)). 4 Tableau is available via anonymous FTP at ftp.mrg.dist.unige.it in pub/mrg-systems/tableau. 5 Kris is available via anonymous FTP at ftp.dfki.uni-sb.de in /pub/tacos/KRIS. The pap... |

9 | Hard and Easy - Mitchell, Selman, et al. - 1992 |