Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae

@inproceedings{Cadoli1997ExperimentalAO,
  title={Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae},
  author={Marco Cadoli and Andrea Giovanardi and Marco Schaerf},
  booktitle={AI*IA},
  year={1997}
}
Although Knowledge Representation is full of reasoning problems that have been formally proved to be both NP-hard and coNP-hard, the experimental analysis has largely focused on problems belonging to either NP or coNP. We still do not know, for example, whether well studied phenomena such as “phase transition”, which show up for many NP-complete problems (e.g., sat) happen for Σp2-complete problems, and whether they are related to an “easy-hard-easy” pattern or not. The goal of this paper is to… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

The DLV system for knowledge representation and reasoning

VIEW 12 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Solving Hard ASP Programs Efficiently

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A new parallel architecture for QBF tools

  • 2010 International Conference on High Performance Computing & Simulation
  • 2010
VIEW 2 EXCERPTS
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Special volume onfrontiers of problem solving : Phase transitions and complexity

B. A. Hubermann T. Hogg, C. P. Williams
  • Arti cialIntelligence Journal
  • 1996

Experimental results on the crossoverpoint in satis ability problems

L. D. Auton.
  • Proceedings of the Eleventh NationalConference on Arti cial Intelligence
  • 1993

Hard and easy distributions forSAT problems

B. Selman
  • Proceedings of the Tenth National Conference on Arti cialIntelligence ( AAAI92 )
  • 1993

Where the really hardproblem are

B. Kanefski P. Cheeseman, W. M. Taylor
  • Proceedings of the Twelfth International Joint Conferenceon Arti cial Intelligence ( IJCAI91 ) , pages
  • 1991

Experimental analysis of the computational cost of satis ability checking in logics for commonsense reason

Marco Cadoli, Andrea Giovanardi, +3 authors Roberto Sebastiani.