Publication:3477998
From MaRDI portal
zbMath0699.68112MaRDI QIDQ3477998
Krzysztof R. Apt, Howard A. Blair
Publication date: 1990
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
03D55: Hierarchies of computability and definability
Related Items
Negation in rule-based database languages: A survey, Logic programming with infinite sets, How complicated is the set of stable models of a recursive logic program?, A context for belief revision: forward chaining-normal nonmonotonic rule systems, A theory of nonmonotonic rule systems. II, Seminormal stratified default theories, Revision programming, The expressiveness of locally stratified programs, Complexity and undecidability results for logic programming, Automata and Answer Set Programming