MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The complexity of model checking for propositional default logics." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

The Complexity of Model Checking for Propositional Default Logics
by Paolo Liberatore, Marco Schaerf — 1998 — Proc. of ECAI'98
…The Complexity of Model Checking for Propositional Default Logics Paolo Liberatore and Marco…
Cited by 5 (1 self) – Add To MetaCart

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable
by Robert Baumgartner, Georg Gottlob — 1999 — In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI99
…On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable…
Cited by 4 (1 self) – Add To MetaCart

Model Checking for Nonmonotonic Logics: Algorithms and Complexity
by Riccardo Rosati — 1999 — Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI’99
…@(email omitted); Abstract. We study the complexity of model checking in propositional nonmonotonic logics…
Cited by 1 (0 self) – Add To MetaCart

Publication List 1999
by Inst. f. Informationssysteme, TU Wien, Et Al, Proceedings German, Conference Knowledge-based, Francesco Buccafurri, Nicola Leone, Pasquale Rullo Semantics, Er Felfernig, Gerhard Friedrich, Dietmar Jannach, Domenico Sacca Nicola Leone — 1999
…] Robert Baumgartner and Georg Gottlob. On the Complexity of Model Checking for Propositional Default…
Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB