Searching for "Perfect Model Semantics." – sorted by Relevance.

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

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

177 documents found, showing 1 through 10. Next 10 →

Completeness of Depth-bounded Resolution for Weakly Reducing Programs
by Hiroki Arimura — 1991 — Software Science and Engineering, World Scientific Series in Computer Science
… to the perfect model semantics. Finally we syntactically characterize a subclass of the class, called weakly…
Cited by 1 (1 self) – Add To MetaCart

Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model (Extended
by Teodor C. Przymusinski — 1989
… Abstract 1 Introduction The perfect model semantics [ABW88, VG89b, Prz88a, Prz89b] provides an attractive…
Cited by 119 (12 self) – Add To MetaCart

On computing minimal and perfect model membership
by C. A. Johnson — 1996 — Data and Knowledge Engineering
…. The handling of negative premises is also considered using perfect model semantics, and methods for computing…
Cited by 3 (3 self) – Add To MetaCart

The well-founded semantics is a stratified Fitting semantics
by Pascal Hitzler, Matthias Wendt — 2002 — Proceedings of the 25th Annual German Conference on Arti Intelligence, KI2002
…, of the Fitting semantics, the well-founded semantics, and the weakly perfect model semantics. The results…
Cited by 4 (3 self) – Add To MetaCart

Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
by Thomas Lukasiewicz — 2001 — In In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), number 2173 in Lecture Notes in Artificial Intelligence
… programs under the semantics of minimal models, perfect models, stable models, and least model states can…
Cited by 12 (0 self) – Add To MetaCart

Stable Semantics for Disjunctive Programs
by Teodor C. Przymusinski — 1991 — New Generation Computing
… coincide with the perfect model semantics. ffl The partial disjunctive stable semantics can be generalized…
Cited by 140 (2 self) – Add To MetaCart

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
by Thomas Eiter, Georg Gottlob — 1995
… closed world assumption, and the perfect model semantics, and we show that the inference problem…
Cited by 78 (27 self) – Add To MetaCart

Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
by Thomas Lukasiewicz — 1999 — In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 1730 of LNAI
… truth-functional semantics. We then dene minimal, perfect, and stable models and show that they have…
Cited by 10 (5 self) – Add To MetaCart

The Stratified µ-Calculus
by Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski
… tabled-resolution procedure for constraint logic programs with the perfect-model semantics. 1…
Add To MetaCart

Stable Classes and Operator Pairs for Disjunctive Programs
by Jürgen Kalinski — 1995 — Proc. of the 3rd Int. Conference on Logic Programming and Nonmonotonic Reasoning
…. It generalizes the perfect model semantics and is closely related with Autoepistemic Logic [14] as a major…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

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