Open AccessFirst‐Order Logic with Inductive Definitions for Model‐Based Problem Solving
Author(s) -
Bruynooghe Maurice,
Denecker Marc,
Truszczyński Mirosław
Publication year - 2016
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v37i3.2679
Subject(s) - inductive logic programming , logic programming , programming language , computer science , logic program , answer set programming , set (abstract data type) , trace (psycholinguistics) , order (exchange) , declarative programming , inductive programming , theoretical computer science , programming paradigm , philosophy , linguistics , finance , economics
In answer set programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used toward the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP. We discuss here one such logic, the logic FO(ID), and its implementation IDP3. The choice is motivated by notable similarities between ASP and FO(ID), even if both approaches trace back to different origins.