- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
New models for generating hard random boolean formulas and disjunctive logic programs
Artificial Intelligence 279 (C):103185 (2020)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.
Magic Sets for disjunctive Datalog programs.Mario Alviano, Wolfgang Faber, Gianluigi Greco & Nicola Leone - 2012 - Artificial Intelligence 187-188 (C):156-192.
Popularity-similarity random SAT formulas.Jesús Giráldez-Cru & Jordi Levy - 2021 - Artificial Intelligence 299 (C):103537.
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies.Mark Kaminski, Yavor Nenov & Bernardo Cuenca Grau - 2016 - Artificial Intelligence 236 (C):90-118.
Generating hard satisfiability problems.Bart Selman, David G. Mitchell & Hector J. Levesque - 1996 - Artificial Intelligence 81 (1-2):17-29.
Carteggio Croce-Amendola.Benedetto Croce, Giovanni Amendola & Roberto Pertici - 1982 - Istituto Italiano Per Gli Studi Storici.
Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
Hard random 3-SAT problems and the Davis-Putnam procedure.Jon W. Freeman - 1996 - Artificial Intelligence 81 (1-2):183-198.
Enhancing disjunctive logic programming systems by SAT checkers.Christoph Koch, Nicola Leone & Gerald Pfeifer - 2003 - Artificial Intelligence 151 (1-2):177-212.
Theory of Semi-Instantiation in Abstract Argumentation.D. M. Gabbay - 2016 - Logica Universalis 10 (4):431-516.
Analytics
Added to PP
2020-12-22
Downloads
32 (#716,090)
6 months
7 (#749,523)
2020-12-22
Downloads
32 (#716,090)
6 months
7 (#749,523)
Historical graph of downloads
Author's Profile
References found in this work
Design and results of the Fifth Answer Set Programming Competition.Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca - 2016 - Artificial Intelligence 231 (C):151-181.
Generating hard satisfiability problems.Bart Selman, David G. Mitchell & Hector J. Levesque - 1996 - Artificial Intelligence 81 (1-2):17-29.
Experimental results on the crossover point in random 3-SAT.James M. Crawford & Larry D. Auton - 1996 - Artificial Intelligence 81 (1-2):31-57.
Solving QBF with counterexample guided refinement.Mikoláš Janota, William Klieber, Joao Marques-Silva & Edmund Clarke - 2016 - Artificial Intelligence 234 (C):1-25.
Generating SAT instances with community structure.Jesús Giráldez-Cru & Jordi Levy - 2016 - Artificial Intelligence 238:119-134.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-mnmvz uwo