Work

Deductive Systems for Logic Programs with Counting

Year: 2025

Type: article

Abstract: In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of the other in an appropriate deductive system. This paper shows how to extend this method of proving strong equivalence to programs containing the counting aggregate.

Source: Theory and Practice of Logic Programming

DOI: 10.1017/s1471068425100379

Authors: JORGE FANDINNO, VLADIMIR LIFSCHITZ

Institutions: University of Nebraska at Omaha, The University of Texas at Austin

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,550

OpenAlex ID: W7118008015

FWCI: 0.411

Cites: 14

Cited by: 1

Related to: