HYPROLOG: A new logic programming language with assumptions and abduction. We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars. The language shows a novel flexibility in the interaction between the different paradigms, including all additional built-in predicates and constraints solvers that may be available. Assumptions and abduction are especially useful for language processing, and we can show how HYPROLOG works seamlessly together with the grammar notation provided by the underlying Prolog system. An operational semantics is given which complies with standard declarative semantics for the “pure” sublanguages, while for the full HYPROLOG language, it must be taken as definition. The implementation is straightforward and seems to provide for abduction, the most efficient of known implementations; the price, however, is a limited use of negations. The main difference wrt. previous implementations of abduction is that we avoid any level of metainterpretation by having Prolog execute the deductive steps directly and by treating abducibles (and assumptions as well) as CHR constraints.

References in zbMATH (referenced in 13 articles , 1 standard article )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Bistarelli, Stefano; Martinelli, Fabio; Santini, Francesco: A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials (2012)
  2. Moniz Pereira, Luís; Pinto, Alexandre Miguel: Inspecting side-effects of abduction in logic programs (2011)
  3. Alberti, Marco; Gavanelli, Marco; Lamma, Evelina: Runtime addition of integrity constraints in an abductive proof procedure (2010)
  4. Montali, Marco; Torroni, Paolo; Chesani, Federico; Mello, Paola; Alberti, Marco; Lamma, Evelina: Abductive logic programming as an effective technology for the static verification of declarative business processes (2010)
  5. Sneyers, Jon; van Weert, Peter; Schrijvers, Tom; de Koninck, Leslie: As time goes by: constraint handling rules (2010)
  6. Christiansen, Henning: Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules (2009)
  7. Gavanelli, Marco; Alberti, Marco; Lamma, Evelina: Integration of abductive reasoning and constraint optimization in SCIFF (2009)
  8. Mancarella, Paolo; Terreni, Giacomo; Sadri, Fariba; Toni, Francesca; Endriss, Ulle: The CIFF proof procedure for abductive logic programming with constraints: theory, implementation and experiments (2009)
  9. Christiansen, Henning: Implementing probabilistic abductive logic programming with constraint handling rules (2008)
  10. Montali, Marco; Torroni, Paolo; Alberti, Marco; Chesani, Federico; Gavanelli, Marco; Lamma, Evelina; Mello, Paola: Verification from declarative specifications using logic programming (2008)
  11. Christiansen, Henning: On the implementation of global abduction (2007)
  12. Christiansen, Henning; Dahl, Veronica: HYPROLOG: A new logic programming language with assumptions and abduction (2005)
  13. Gabbrielli, Maurizio (ed.); Gupta, Gopal (ed.): Logic programming. 21st international conference, ICLP 2005, Sitges, Spain, October 2--5, 2005. Proceedings. (2005)