scientific article; zbMATH DE number 1884395
From MaRDI portal
Publication:4798015
zbMath1007.68503MaRDI QIDQ4798015
Publication date: 18 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2173/21730267.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)
Related Items (19)
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions ⋮ One More Decidable Class of Finitely Ground Programs ⋮ 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 ⋮ What is answer set programming to propositional satisfiability ⋮ Weight constraint programs with evaluable functions ⋮ External sources of knowledge and value invention in logic programming ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Answer Set Programming: A Primer ⋮ Partial Functions and Equality in Answer Set Programming ⋮ Computable Functions in ASP: Theory and Implementation ⋮ Composing Normal Programs with Function Symbols ⋮ Extending and implementing the stable model semantics ⋮ Logic programming with infinite sets ⋮ Domain expansion for ASP-programs with external sources ⋮ Reasoning with infinite stable models
This page was built for publication:
