Fages' Theorem and Answer Set Programming

03/09/2000
by   Yuliya Babovich, et al.
0

We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as smodels and dlv is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelae is discussed as an example.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2019

SMT-based Constraint Answer Set Solver EZSMT+

Constraint answer set programming integrates answer set programming with...
research
08/04/2016

Query Answering in Resource-Based Answer Set Semantics

In recent work we defined resource-based answer set semantics, which is ...
research
05/03/2011

Transition Systems for Model Generators - A Unifying Approach

A fundamental task for propositional logic is to compute models of propo...
research
04/05/2013

Probability Aggregates in Probability Answer Set Programming

Probability answer set programming is a declarative programming that has...
research
05/24/2023

On Program Completion, with an Application to the Sum and Product Puzzle

This paper describes a generalization of Clark's completion that is appl...
research
09/17/2021

Quantitative and Stream Extensions of Answer Set Programming

Answer Set Programming has separately been extended with constraints, to...
research
10/06/2015

Disjunctive Answer Set Solvers via Templates

Answer set programming is a declarative programming paradigm oriented to...

Please sign up or login with your details

Forgot password? Click here to reset