scientific article; zbMATH DE number 708499

zbMath0834.68007MaRDI QIDQ4318616

Kees Doets

Publication date: 9 January 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

logic programmingHorn-clauses logic

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Logic programming (68N17)

Related Items

Correctness and Completeness of Logic Programs, Connecting First-Order ASP and the Logic FO(ID) through Reducts, First-order theories for pure Prolog programs with negation, A representation of recursively enumerable sets through Horn formulas in higher recursion theory, On Completeness of Logic Programs, Linguistic\(\leftrightarrow \)rational agents' semantics, On definite program answers and least Herbrand models, On correctness of normal logic programs, Three-valued completion for abductive logic programs, Proving completeness of logic programs with the cut, Minimal predicates, fixed-points, and definability, A study of a generalization of a card problem, Nonmonotonicity in the framework of parametric logic, A hybrid reasoning system for terminologies and first-order clauses in knowledge bases, New Advances in Logic-Based Probabilistic Modeling by PRISM, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Fixpoint semantics for logic programming a survey, Order-sorted logic programming with predicate hierarchy, Unifying logic, topology and learning in parametric logic