A First Order Forward Chaining Approach for Answer Set Computing

DOI10.1007/978-3-642-04238-6_18zbMath1258.68033OpenAlexW1545915159MaRDI QIDQ3643118

Claire Lefèvre, Pascal Nicolas

Publication date: 10 November 2009

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04238-6_18

Mathematics Subject Classification ID

Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (3)

Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ Unnamed Item ⋮ $$\exists $$ -ASP for Computing Repairs with Existential Ontologies

Uses Software

• Gringo
• Unnamed Item
• Unnamed Item

This page was built for publication: A First Order Forward Chaining Approach for Answer Set Computing