A First Order Forward Chaining Approach for Answer Set Computing

DOI10.1007/978-3-642-04238-6_18zbMATH Open1258.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

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

Cited In (4)

• Title not available (Why is that?)
• $$\exists $$ -ASP for Computing Repairs with Existential Ontologies
• Logic programming
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin

Uses Software

• ASPeRiX
• ASSAT
• Gringo

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643118)