scientific article

From MaRDI portal

Revision as of 21:33, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3477998

Jump to:navigation, search

zbMath0699.68112MaRDI QIDQ3477998

Krzysztof R. Apt, Howard A. Blair

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

arithmetic hierarchy stratified logic programs recursion theoretic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Hierarchies of computability and definability (03D55)

Related Items (11)

A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ A theory of nonmonotonic rule systems. II ⋮ Seminormal stratified default theories ⋮ The expressiveness of locally stratified programs ⋮ Complexity and undecidability results for logic programming ⋮ Revision programming ⋮ Reasoning with stratified default theories ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Automata and Answer Set Programming ⋮ Negation in rule-based database languages: A survey ⋮ Logic programming with infinite sets

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3477998&oldid=16812379"