First‐Order Logic with Inductive Definitions for Model‐Based Problem Solving

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,...

Full description

Saved in:
Bibliographic Details
Published in:The AI magazine 2016-09, Vol.37 (3), p.69-80
Main Authors: Bruynooghe, Maurice, Denecker, Marc, Truszczyński, Mirosław
Format: Article
Language:English
Subjects:
Artificial intelligence
Automation
Cognition & reasoning
Declarative programming
Knowledge representation
Language
Logic programming
Mathematical programming
Methods
Problem solving
Semantics
Syntax
Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0738-4602
2371-9621
DOI:10.1609/aimag.v37i3.2679