Graphs and colorings for answer set programming
From MaRDI portal
Publication:3426201
DOI10.1017/S1471068405002528zbMATH Open1109.68081OpenAlexW2166174694MaRDI QIDQ3426201FDOQ3426201
Authors: Kathrin Konczak, T. Linke, Torsten Schaub
Publication date: 8 March 2007
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068405002528
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17) Semantics in the theory of computing (68Q55)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Logic Programming: A Sequel
- Title not available (Why is that?)
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Justifications for logic programs under answer set semantics
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Labellings for assumption-based and abstract argumentation
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
- Logic Programming and Nonmonotonic Reasoning
- Logic for Programming, Artificial Intelligence, and Reasoning
- Title not available (Why is that?)
Uses Software
This page was built for publication: Graphs and colorings for answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426201)