Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique
Reexamination Certificate
2011-08-16
2011-08-16
Holmes, Michael (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Knowledge representation and reasoning technique
Reexamination Certificate
active
08001072
ABSTRACT:
A function can be represented as a canonical decision diagram structure. Each vertex of the diagram is associated with a respective function variable. The vertices include at least one vertex that represents a domain of more than two values for the variable associated with the vertex. The decision diagram is used to evaluate the function to determine whether the function is satisfiable or unsatisfiable for given values of the variables.
REFERENCES:
patent: 5276897 (1994-01-01), Stalmarck
patent: 6714902 (2004-03-01), Chao et al.
patent: 7120569 (2006-10-01), Arroyo-Figueroa
patent: 7216306 (2007-05-01), Li
patent: 7506290 (2009-03-01), Jacobi et al.
patent: 7552407 (2009-06-01), Baumgartner et al.
patent: 7689943 (2010-03-01), Baumgartner et al.
patent: 7739635 (2010-06-01), Baumgartner et al.
patent: 7752593 (2010-07-01), Baumgartner et al.
patent: 7765514 (2010-07-01), Baumgartner et al.
patent: 7788616 (2010-08-01), Baumgartner et al.
patent: 7793242 (2010-09-01), Baumgartner et al.
patent: 7882470 (2011-02-01), Baumgartner et al.
patent: 7908575 (2011-03-01), Baumgartner et al.
patent: 7913205 (2011-03-01), Baumgartner et al.
patent: 7917874 (2011-03-01), Baumgartner et al.
patent: 7921394 (2011-04-01), Baumgartner et al.
patent: 2007/0162966 (2007-07-01), Agrawal et al.
Decision Problems of Phrase-Structure Grammars, Landweber, Peter S.; Electronic Computers, IEEE Transactions on vol. EC-13 , Issue: 4 Digital Object Identifier: 10.1109/PGEC.1964.263815 Publication Year: 1964 , pp. 354-362.
Routing Strategies to Enhance Traffic Capacity for Scale-Free Networks, Jianwei Wang; Lili Rong; Liang Zhang; Intelligent Computation Technology and Automation (ICICTA), 2008 International Conference on vol. 2 Digital Object Identifier: 10.1109/ICICTA.2008.103 Publication Year: 2008 , pp. 451-455.
Kaser: a qualitatively fuzzy object-oriented inference engine, Rubin, S.H.; Rush, R.J., Jr.; Murthy, J.; Smith, M.H.; Trajkovic, L.; Fuzzy Information Processing Society, 2002. Proceedings. NAFIPS. 2002 Annual Meeting of the North American Digital Object Identifier: 10.1109/NAFIPS.2002.1018085 Publication Year: 2002 , pp. 354-359.
Towards an Interpretable Sparseness for Face Recognition: An Empirical Study, Chao Lan; Xiao-yuan Jing; Qian Liu; Yongfang Yao; Jingyu Yang; Pattern Recognition (CCPR), 2010 Chinese Conference on Digital Object Identifier: 10.1109/CCPR.2010.5659245 Publication Year: 2010 , pp. 1-5.
Bryant Randal E. “Graph-Based Algorithms for Boolean Function Manipulation”, Date: Aug. 1986, pp. 1-28, vol. C-35, Issue: 8.
Chelf Ben, “Satisfiability: A New Generation of Static Analysis”, Date: 2007, 3 pages.
Fang, et al. “Complete Local Search for Propositional Satisfiability”, Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI2004), Date: Jul. 25-29, 2004, 6 pages, Copyright: 2004.
Moskewickz, et al. “Chaff: Engineering an Efficient SAT Solver”, Proceedings of the 38th conference on Design automation, Date: Jun. 18-22, 2001, pp. 530-535, ACM Press New York, NY, USA.
Silva, et al. “Grasp: A Search Algorithm for Propositional Satisfiability”, Date: May 1999, pp. 506-521, vol. 48, Issue: 5.
Holmes Michael
Microsoft Corporation
LandOfFree
Determining satisfiability of a function with arbitrary... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Determining satisfiability of a function with arbitrary..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining satisfiability of a function with arbitrary... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2649515