Beyond NP: Quantifying over Answer Sets (Q5108497): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: WASP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: clasp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.09559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of disjunctive programs in WASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in WASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing minimal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable-unstable semantics: Beyond NP with normal logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics and expressiveness of disjunctive ordered logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tarskian Informal Semantics for Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining answer set programming with description logics for the semantic web / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifold Answer-Set Programs and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in clasp Series 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex optimization in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sixth Answer Set Programming Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DLV system for knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set programming and plan generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Graph Pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining inconsistency in answer set programs and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127174382 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098293022 / rank
 
Normal rank

Latest revision as of 09:59, 30 July 2024

scientific article; zbMATH DE number 7196140
Language Label Description Also known as
English
Beyond NP: Quantifying over Answer Sets
scientific article; zbMATH DE number 7196140

    Statements

    Beyond NP: Quantifying over Answer Sets (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2020
    0 references
    ASP
    0 references
    quantified logics
    0 references
    polynomial hierarchy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers