Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parameterized complexity of abduction in Schaefer’s framework

From MaRDI portal
Publication:5028318
Jump to:navigation, search

DOI10.1093/logcom/exaa079OpenAlexW3118093767MaRDI QIDQ5028318

Yasir Mahmood, Johannes Schmidt, Arne Meier

Publication date: 8 February 2022

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa079


zbMATH Keywords

non-monotonic reasoningabductionparameterized complexitySchaefer's frameworkco-clones


Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)


Related Items (1)

Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework






This page was built for publication: Parameterized complexity of abduction in Schaefer’s framework

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5028318&oldid=19496078"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki