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

scientific article; zbMATH DE number 6862078

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

DOI10.4230/LIPIcs.FSTTCS.2016.50zbMath1391.68099arXiv1606.03289MaRDI QIDQ4636600

Nikola Beneš, Jiří Barnat, Jaroslav Bendík, Ivana Černá

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1606.03289

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

zbMATH Keywords

infeasibility analysisminimal unsatisfiable subsetsmaximal satisfiable subsetsunsatisfiability analysis


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items

Counting minimal unsatisfiable subsets, Unnamed Item, Timed automata relaxation for reachability



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