A multiparametric view on answer set programming

Disjunctive answer set programming (ASP) is an important framework for declarative modeling and problem solving, where the computational complexity of basic decision problems like consistency (deciding whether a program has an answer set) is located on the second level of the polynomial hierarchy. D...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of mathematics and artificial intelligence Ročník 86; číslo 1-3; s. 121 - 147
Hlavní autoři:	Fichte, Johannes K., Kronegger, Martin, Woltran, Stefan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.07.2019 Springer Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Complex Systems Complexity Computer Science Computers Consistency Declarative programming Graph representations Hardness Logic Mathematical programming Mathematics Optimization Parameterization Parameters Polynomials Problem solving Semantics Services Tightness Answer set programming (ASP) Multiparametric complexity Parameterized complexity theory Secondary 68T30, 03B42, 03B70, 68T27, 8Q15 Multi parameterizations Primary 03D15 Fixed-parameter tractability
ISSN:	1012-2443, 1573-7470
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!