Autoepistemic answer set programming
type: Item
instance of: scholarly article
title: Autoepistemic answer set programming
zbMATH Open document ID: 1504.68208
author: Pedro Cabalar
author: Jorge Fandinno
author: Luis Fariñas del Cerro
published in: Artificial Intelligence
publication date: 2021-08-16T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 7382225
zbMATH Keywords: answer set programming
zbMATH Keywords: epistemic specifications
zbMATH Keywords: epistemic logic programs
zbMATH Keywords: autoepistemic logic
zbMATH Keywords: non-monotonic reasoning
zbMATH Keywords: equilibrium logic
describes a project that uses: eclingo
describes a project that uses: Clingo
MaRDI profile type: Publication
full work available at URL: j.artint.2020.103382
OpenAlex ID: W3082775062
cites work: Temporal equilibrium logic: a survey
cites work: Forgetting auxiliary atoms in forks
cites work: Verifying security protocols as planning in logic programming
cites work: Semi-equilibrium models for paracoherent answer set programs
cites work: Q5869667
cites work: Gelfond-Zhang aggregates as propositional formulas
cites work: Lower bound founded logic of here-and-there
cites work: Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
cites work: eclingo : A Solver for Epistemic Logic Programs
cites work: Partial equilibrium logic
cites work: A First-order Theory of Communication and Multi-agent Plans
cites work: Dynamic epistemic logic
cites work: Minimal temporal epistemic logic
cites work: Q4845472
cites work: Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
cites work: New Semantics for Epistemic Specifications
cites work: Q4844165
cites work: Logic programming and reasoning with incomplete information
cites work: Infinitary equilibrium logic and strongly equivalent logic programs
cites work: The language of epistemic specifications (refined) including a prototype solver
cites work: On the relation between default and autoepistemic logic
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: Minimal belief and negation as failure
cites work: A logic of knowledge and justified assumption
cites work: Q3486549
cites work: Q4702577
cites work: Q4273952
cites work: Non-monotonic logic. I
cites work: Semantical considerations on nonmonotonic logic
cites work: Q4012233
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Equilibrium logic
cites work: Deductive Algorithmic Knowledge
cites work: Fuzzy Equilibrium Logic
cites work: Evaluating epistemic negation in answer set programming
cites work: Autoepistemic equilibrium logic and epistemic specifications
cites work: Revisiting Epistemic Specifications
cites work: Q4578043
cites work: The well-founded semantics for general logic programs
cites work: Logic Programming and Nonmonotonic Reasoning
DOI: 10.1016/J.ARTINT.2020.103382
description: scientific article; zbMATH DE number 7382225