A progression semantics for first-order logic programs
type: Item
instance of: scholarly article
title: A progression semantics for first-order logic programs
zbMATH Open document ID: 1419.68035
author: Peng Zhang
published in: Artificial Intelligence
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6807698
zbMATH Keywords: logic programming
zbMATH Keywords: stable model semantics
zbMATH Keywords: progression semantics
zbMATH Keywords: first-order logic
describes a project that uses: ASSAT
describes a project that uses: Cmodels
MaRDI profile type: Publication
full work available at URL: j.artint.2017.06.001
OpenAlex ID: W2623765780
cites work: Q4864249
cites work: Datalog vs first-order logic
cites work: Ordered completion for logic programs with aggregates
cites work: Ordered completion for first-order logic programs on finite structures
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: On the stable model semantics for intensional functions
cites work: Global inductive definability
cites work: Loop-separable programs and their first-order definability
cites work: A Tarskian Informal Semantics for Answer Set Programming
cites work: Q4850061
cites work: Stable models and circumscription
cites work: Undecidable optimization problems for database logic programs
cites work: Conflict-driven answer set solving: from theory to practice
cites work: Q3983043
cites work: Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
cites work: Infinitary equilibrium logic and strongly equivalent logic programs
cites work: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
cites work: Q3112629
cites work: Two-Valued Logic Programs
cites work: A logic of knowledge and justified assumption
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: From answer set logic programming to circumscription via logic of GK
cites work: On the foundations of the universal relation model
cites work: Q4702577
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Solving SAT and SAT Modulo Theories
cites work: Logics in Artificial Intelligence
cites work: A logic for default reasoning
cites work: FLP answer set semantics without circular justifications for general logic programs
DOI: 10.1016/J.ARTINT.2017.06.001
description: scientific article; zbMATH DE number 6807698