Titlebook: Innovationen bei Rechen- und Kommunikationssystemen; Eine Herausforderung Bernd Wolfinger Conference proceedings 1994 Springer-Verlag Berli

Alveoli

Integration Of Semiformal And Formal Methods For Specifying Knowledge-Based Systemsl knowledge representation uses a hypermedia-based formalism which serves as a communication basis between expert and knowledge engineer. This representation is also the basis for the formalization process resulting in the formal and executable model of expertise written in KARL. A smooth transition

constitutional

一起平行

Neutral-Spine

From above and from below: Approximating stable modelsnsequence operator for definite programs in cooperation with the Gelfond-Lifschitz transformation. It is first shown that a well-founded approximation for disjunctive programs can be defined in quite the same way. It is then demonstrated that knowledge compilation — originally introduced as an appro

得意人

osculate

蹒跚

形状

Mobile

Proof Procedures for Disjunctive Logic Programminginclude SLO-resolution (Rajasekar, Minker), SLI-resolution (Minker, Zanon) and near-Horn Prolog in several variants (Loveland, Reed). Other procedures extend SLD-resolution to the full first-order predicate calculus and thus are also candidates for consideration as procedures for the DLP domain. Exa

lactic

TMPR for Disjunctive Logic Programming and Usefulness of Strong and Exclusion Negations suitability for disjunctive logic programming. TMPR needs no contrapositives and extends SLD-resolution with a Prolog-style backward chaining by a controlled use of case analysis. This is done without having to extend negative goals needed, e.g., for model elimination. Performing case analysis at