A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions

DOI10.1007/978-3-642-30743-0_3zbMath1248.68468OpenAlexW189070505MaRDI QIDQ2900504

Marcello Balduccini

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_3

zbMATH Keywords

nonmonotonic reasoninglogic programminganswer set programmingstable modelsmany-to-one functionsnon-Herbrand functions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (2)

P-log: refinement and a new coherency condition ⋮ First-order stable model semantics with intensional functions

Uses Software

• Clingcon

Cites Work

• Unnamed Item
• Unnamed Item
• Functional answer set programming
• A decidable subclass of finitary programs
• Probabilistic reasoning with answer sets
• Weight Constraint Programs with Functions
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Constraint Answer Set Solving
• Diagnostic reasoning with A-Prolog

This page was built for publication: A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions