Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
An alternative transformation rule for logic programs
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
On quantitative measurement of negation in logic programming
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Optimal unification and learning algorithms for categorial grammars
Fundamenta Informaticae
Proving Correctness and Completeness of Normal Programs - A Declarative Approach
Proceedings of the 17th International Conference on Logic Programming
Learning in Logic with RichProlog
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Statistical Abduction with Tabulation
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Parameterized Logic Programs where Computing Meets Learning
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Compiling Horn-Clause Rules in IBM`s Business System 12 and Early Experiment in Declarativeness
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Efficient EM Learning with Tabulation for Parameterized Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Learning, Logic, and Topology in a Common Framework
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A General Theory of Deduction, Induction, and Learning
DS '01 Proceedings of the 4th International Conference on Discovery Science
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
Order-sorted logic programming with predicate hierarchy
Artificial Intelligence
Encyclopedia of Computer Science
Proving correctness and completeness of normal programs – a declarative approach
Theory and Practice of Logic Programming
Unifying logic, topology and learning in parametric logic
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
New Generation Computing
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
A glimpse of symbolic-statistical modeling by PRISM
Journal of Intelligent Information Systems
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
Inside-outside probability computation for belief propagation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Distributed reasoning with ontologies and rules in order-sorted logic programming
Web Semantics: Science, Services and Agents on the World Wide Web
Generative modeling with failure in PRISM
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Characterizing Pawlak's approximation operators
Transactions on rough sets VII
New advances in logic-based probabilistic modeling by PRISM
Probabilistic inductive logic programming
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Disjunctive constraint lambda calculi
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Negation elimination for finite PCFGs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Ten theses on logic languages for the semantic web
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Sorted hyper-predicate knowledge bases for ontologies and rules
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Connecting first-order ASP and the logic FO(ID) through reducts
Correct Reasoning
Optimal Unification and Learning Algorithms for Categorial Grammars
Fundamenta Informaticae
Hi-index | 0.00 |
From the Publisher:This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.