✦ LIBER ✦

Generalized satisfiability for the description logic

✍ Scribed by Meier, Arne; Schneider, Thomas

Book ID: 123213666
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 672 KB
Volume: 505
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.02.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reducing OWL entailment to description l

Reducing OWL entailment to description logic satisfiability

✍ Ian Horrocks; Peter Patel-Schneider 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Finite satisfiability for guarded fixpoi

Finite satisfiability for guarded fixpoint logic

✍ Vince Bárány; Mikołaj Bojańczyk 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Backjumping for Quantified Boolean Logic

Backjumping for Quantified Boolean Logic satisfiability

✍ Enrico Giunchiglia; Massimo Narizzano; Armando Tacchella 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 221 KB

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland proc

Satisfiability and reasoning mechanism o

Satisfiability and reasoning mechanism of terminological cycles in description logic( vmathcal{L} )

✍ Ju Wang; YunCheng Jiang; YuMing Shen 📂 Article 📅 2008 🏛 Science in China Press (SCP) 🌐 English ⚖ 583 KB

A method to generate formulas for tempor

A method to generate formulas for temporal logic satisfiability checkers

✍ Toshifusa Sekizawa; Toshinori Takai; Yoshinori Tanabe; Koichi Takahashi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

Generalized fuzzy rough description logi

Generalized fuzzy rough description logics

✍ Fernando Bobillo; Umberto Straccia 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 474 KB