On the declarative and procedural semantics of logic programs

DOI10.1007/BF00243002zbMath0681.68109MaRDI QIDQ1823724

Teodor C. Przymusinski

Publication date: 1989

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

Herbrand modelsSLD-resolutionnon-monotonic logicLogic Programmingdeclarative and procedural semanticsSLS-resolution

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Properties of classes of models (03C52) Models of other mathematical theories (03C65)

Related Items

Combining event calculus and description logic reasoning via logic programming, A three-valued semantics for deductive databases and logic programs, What is failure? An approach to constructive negation, Modular materialisation of Datalog programs, A note on the stable model semantics for logic programs, Well-founded and stationary models of logic programs, Propositional semantics for disjunctive logic programs, Enhancing Magic Sets with an Application to Ontological Reasoning, Semantic-based construction of arguments: an answer set programming approach, Layerings of logic programs -- layer decomposable semantics and incremental model computation, Unnamed Item, General logical databases and programs: Default logic semantics and stratification, Acyclic logic programs and the completeness of SLDNF-resolution, Three-valued nonmonotonic formalisms and semantics of logic programs, Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes), On Inductive Proofs by Extended Unfold/Fold Transformation Rules, Complete extension of general logic programs, A logic of knowledge and justified assumption, On the Coincidence of Semantics for Uniquely Determined Programs, On intuitionistic query answering in description bases, The semantics of incomplete databases as an expression of preferences