Omega-restricted logic programs

DOI10.1007/3-540-45402-0_20MaRDI QIDQ4798015zbMATH OpenFDO

Authors Tommi Syrjänen

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2173/21730267.htm

Mathematics Subject Classification ID

Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Logics in Artificial Intelligence
• Logic programs with stable model semantics as a constraint programming paradigm
• The Stable Models of a Predicate Logic Program
• Stable models and an alternative logic programming paradigm
• One More Decidable Class of Finitely Ground Programs

Cited in

(23)

• Extending and implementing the stable model semantics
• What is answer set programming to propositional satisfiability
• External sources of knowledge and value invention in logic programming
• Domain expansion for ASP-programs with external sources
• A ``conservative approach to extending answer set programming with non-Herbrand functions
• Answer Set Programming: A Primer
• Logic programming with recurrence domains
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Using linear constraints for logic program termination analysis
• Disjunctive answer set solvers via templates
• Optimizing answer set computation via heuristic-based decomposition
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• Index sets for finite normal predicate logic programs with function symbols
• One More Decidable Class of Finitely Ground Programs
• Logics in Artificial Intelligence
• Partial Functions and Equality in Answer Set Programming
• Computable Functions in ASP: Theory and Implementation
• Composing Normal Programs with Function Symbols
• Weight constraint programs with evaluable functions
• On the foundations of grounding in answer set programming
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
• Logic programming with infinite sets
• Reasoning with infinite stable models

This page was built for publication: Omega-restricted logic programs

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