selp: A Single-Shot Epistemic Logic Program Solver

DOI10.1017/S1471068420000022zbMath1472.68022arXiv2001.01089OpenAlexW3008962280MaRDI QIDQ4957201

Manuel Bichler, Stefan Woltran, Michael Morak

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01089

zbMATH Keywords

knowledge representationnonmonotonic reasoninglogic programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (6)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Thirty years of Epistemic Specifications ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ A parallel memory-efficient epistemic logic program solver: harder, better, faster ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

Uses Software

• Gringo
• WASP
• Clingo
• htd
• Lpopt
• GI-log
• selp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluating epistemic negation in answer set programming
• Stable models and circumscription
• Semantics and complexity of recursive aggregates in answer set programming
• Equilibrium logic
• Conflict-driven answer set solving: from theory to practice
• On the computational cost of disjunctive logic programming: Propositional case
• Logic programming and reasoning with incomplete information
• Nested expressions in logic programs
• A parallel memory-efficient epistemic logic program solver: harder, better, faster
• Lpopt: a rule optimization tool for answer set programming
• Complexity results for answer set programming with bounded predicate arities and implications
• FLP answer set semantics without circular justifications for general logic programs
• Revisiting Epistemic Specifications
• New Semantics for Epistemic Specifications
• The language of epistemic specifications (refined) including a prototype solver
• Well-founded and stable semantics of logic programs with aggregates
• Solution Enumeration for Projected Boolean Search Problems
• Logic Programming with Graded Introspection
• The power of non-ground rules in Answer Set Programming
• On Uniform Equivalence of Epistemic Logic Programs
• Multi-shot ASP solving with clingo
• The Impact of Treewidth on Grounding and Solving of Answer Set Programs
• Preprocessing of Complex Non-Ground Rules in Answer Set Programming

This page was built for publication: selp: A Single-Shot Epistemic Logic Program Solver