Data processing: artificial intelligence – Neural network – Learning task
Reexamination Certificate
2006-01-09
2009-08-18
Vincent, David R (Department: 2129)
Data processing: artificial intelligence
Neural network
Learning task
C706S046000, C706S057000
Reexamination Certificate
active
07577625
ABSTRACT:
In order to provide for more efficient QBF satisfiability determination, the formula to be checked is transformed into one formula which is equi-satisfiable, and one which is equi-tautological. The conjunction or disjunction of these two formulas, then, is used to determine satisfiability, with the result being that a determination of satisfiability is more easily achieved. A conjunctive normal form transformation of the initial formula yields a group of clauses, only one of which must be unsatisfiable for the formula to be unsatisfiable. A disjunctive normal form transformation of the initial formula yields a group of cubes, only one of which must be satisfiable in order for the formula to be determined to be satisfiable.
REFERENCES:
Zhang et al., “Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation”, 2002.
Biere, A., “Resolve and Expand”,Proceedings of the 7thInternational Conference on Theory and Applications of Satisfiability Testing(SAT '04), May 2004, 12 pages.
Cadoli, M. et al., “An Algorithm to Evaluate Quantified Boolean Formulae”,Proceedings of the 16thNational Conference on Artificial Intelligence(AAAI-98), 1998, 6 pages.
Giunchiglia, E. et al., “Learning for Quantified Boolean Logic Satisfiability”,18thNational Conference on Artificial Intelligence(AAAI-02), 2002, 6 pages.
Letz, R., “Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas”,TABLEAUX, 2002, LNAI 2381, 160-175.
Zhang, L. et al., “Conflict Driven Learning in a Quantified Boolean Satisfiability Solver”,Proceedings of International Conference on Computer Aided Design(ICCAD2002), 8 pages.
Zhang, L. et al., “Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation”,Proceedings of the 8thInternational Conference on Principles and Practice of Best Paper Award Winner Constraint Programming(CP2002), 2002, 15 pages.
Brown, Jr. Nathan H
Microsoft Corporation
Vincent David R
Woodcock & Washburn LLP
LandOfFree
Handling of satisfaction and conflicts in a quantified... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Handling of satisfaction and conflicts in a quantified..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Handling of satisfaction and conflicts in a quantified... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4123102