• Corpus ID: 9050762

Problem solving in ID-logic with aggregates: some experiments

  title={Problem solving in ID-logic with aggregates: some experiments},
  author={Bert Van Nuffelen and Marc Denecker},
The goal of the LP+ project at the K.U.Leuven is to design an expressive logic, suitable for declarative knowledge representation, and to develop intelligent systems based on Logic Programming technology for solving computational problems using the declarative specifications. The ID-logic is an integration of typed classical logic and a definition logic. Different abductive solvers for this language are being developed. This paper is a report of the integration of high order aggregates into ID… 
Abduction in Logic Programming
This paper aims to chart out the main developments of the field over the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational and suitability to application.
ProLogICA : a practical system for Abductive Logic Programming
This paper presents a new system called ProLogICA for Abductive Logic Programming (ALP) with Negation as Failure (NAF) and Integrity Constraints (ICs). The system builds upon existing ALP techniques
Semantics of logic programs with aggregates
A framework admits arbitrary aggregate relations in the bodies of rules which follows a denotational approach in which a semantics is defined as a (set of) fixpoint(s) of an operator associated with a program.
Abduction in well-founded semantics and generalized stable models via tabled dual programs
ABDUAL is sound and complete for evaluating queries to abductive frameworks whose entailment method is based on either the well-founded semantics with explicit negation, or on answer sets, and is asymptotically as efficient as any known method for either class of problems.
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
A new proof procedure for abductive logic programming is introduced by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly.
Computational Logic: Logic Programming and Beyond
A distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program, and a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic.
Well-founded and stable semantics of logic programs with aggregates
A framework for the semantics and the computation of aggregates in the context of logic programming is presented, and results show that, in practice, even efficient three-valued immediate consequence operators which are very low in the precision hierarchy, still provide optimal precision.
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
The approach uses Approximation Theory, a fixpoint theory of stable and well-founded fixpoints of non-monotone operators in a complete lattice to define the syntax of logic programs with aggregates and define the immediate consequence operator of such programs.


A Terminological Interpretation of (Abductive) Logic Programming
This paper extends the logic program formalism such that some predicates can be left undefined and use classical logic as the language for the ABox and study the expressivity of the formalism for representing uncertainty by proposing solutions for problems in temporal reasoning, with null values and open domain knowledge.
An Open-Ended Finite Domain Constraint Solver
We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint
Extending Classical Logic with Inductive Definitions
  • M. Denecker
  • Philosophy, Computer Science
    Computational Logic
  • 2000
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its
The well-founded semantics of aggregation
Extensions to the semantics, restrictions on the input, and other supplementary requirements proposed in earlier studies appear to be unnecessary for the purpose of attaching a meaning to a program that involves recursion through aggregation.
Negation as Failure
  • K. Clark
  • Computer Science
    Logic and Data Bases
  • 1977
It is shown that when the clause data base and the queries satisfy certain constraints, which still leaves us with a data base more general than a conventional relational data base, the query evaluation process will find every answer that is a logical consequence of the completed data base.
The Semantics of Predicate Logic as a Programming Language
In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.
Monotonic aggregation in deductive databases
This work forms a minimal model of a program component including aggregate operators, rather than insisting that the aggregate apply to atoms that have been fully determined, or that aggregate functions are rewritten in terms of negation.