AI Chat AI Image Generator AI Video Text to Speech

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

05/24/2023

∙

by Vladimir Lifschitz, et al.

∙

∙

This paper describes a generalization of Clark's completion that is applicable to logic programs containing arithmetic operations and produces syntactically simple, natural looking formulas. If a set of first-order axioms is equivalent to the completion of a program then we may be able to find standard models of these axioms by running an answer set solver. As an example, we apply this "reverse completion" procedure to the Sum and Product Puzzle.

page 1

page 2

page 3

page 4

research

∙ 01/08/2013

Lloyd-Topor Completion and General Stable Models

We investigate the relationship between the generalization of program co...

0 Vladimir Lifschitz, et al. ∙

research

∙ 03/09/2000

Fages' Theorem and Answer Set Programming

We generalize a theorem by Francois Fages that describes the relationshi...

0 Yuliya Babovich, et al. ∙

research

∙ 10/16/2019

On the Relation between Weak Completion Semantics and Answer Set Semantics

The Weak Completion Semantics (WCS) is a computational cognitive theory ...

0 Emmanuelle-Anna Dietz Saldanha, et al. ∙

research

∙ 09/30/2018

anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report)

In a recent paper by Harrison et al., the concept of program completion ...

0 Vladimir Lifschitz, et al. ∙

research

∙ 08/05/2020

Verifying Tight Logic Programs with anthem and Vampire

This paper continues the line of research aimed at investigating the rel...

1 Jorge Fandinno, et al. ∙

research

∙ 07/15/2023

Elementary Sets for Logic Programs

By introducing the concepts of a loop and a loop formula, Lin and Zhao s...

0 Martin Gebser, et al. ∙

research

∙ 09/17/2013

A fully automatic problem solver with human-style output

This paper describes a program that solves elementary mathematical probl...

0 M. Ganesalingam, et al. ∙