 2009 (5) |
|
Exploiting Decomposition on Constraint Problems with High Tree-Width. Kitching, M., and Bacchus, F. 2009.
In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009), 525-531.
![Exploiting Decomposition on Constraint Problems with High Tree-Width [PDF]](http://www.bibbase.org/resources/filetypes/pdf.png) ![Exploiting Decomposition on Constraint Problems with High Tree-Width [bib]](http://www.bibbase.org/resources/filetypes/bib.png)
|
Set Branching in Constraint Optimization. Kitching, M., and Bacchus, F. 2009.
In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009), 532-537.
|
Beyond CNF: A Circuit-Based QBF Solver. Goultiaeva, A.; Iverson, V.; and Bacchus, F. 2009.
In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT-2009), 412-426.
![Beyond CNF: A Circuit-Based QBF Solver [http://dx.doi.org/10.1007/978-3-642-02777-2_38]](http://www.bibbase.org/resources/filetypes/html.png)
|
A heuristic search approach to planning with temporally extended preferences. Baier, J. A.; Bacchus, F.; and McIlraith, S. A. 2009.
173(5--6):593-618.
|
Solving #SAT and Bayesian Inference with Backtracking Search. Bacchus, F.; Dalmao, S.; and Pitassi, T. 2009.
J. Artif. Intell. Res. (JAIR), 34:391-442.
|
|
|
| 2008 (3) |
|
Exploiting Decomposition in Constraint Optimization Problems. Kitching, M., and Bacchus, F. 2008.
In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP-2008), 478-492.
|
Clause Learning Can Effectively P-Simulate General Propositional Resolution. Hertel, P.; Bacchus, F.; Pitassi, T.; and Gelder, A. V. 2008.
In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-2008), 283-290.
|
Distributional Importance Sampling for Approximate Weighted Model Counting. Davies, J., and Bacchus, F. 2008.
In Workshop on Counting Problems in CSP and SAT, and other neighbouring problems.
|
|
|
| 2007 (8) |
|
Dynamically Partitioning for Solving QBF. Samulowitz, H., and Bacchus, F. 2007.
In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT-2007), 215-229.
|
Using Expectation Maximization to Find Likely Assignments for Solving CSP's. Hsu, E. I.; Kitching, M.; Bacchus, F.; and McIlraith, S. A. 2007.
In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-2007), 224-230.
|
Symmetric Component Caching. Kitching, M., and Bacchus, F. 2007.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), 118-124.
|
Using More Reasoning to Improve #SAT Solving. Davies, J., and Bacchus, F. 2007.
In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-2007), 185-190.
|
Solution Directed Backjumping for QCSP. Bacchus, F., and Stergiou, K. 2007.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), 148-163.
|
Caching in Backtracking Search (Invited Talk). Bacchus, F. 2007.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), 1-1.
![Caching in Backtracking Search (Invited Talk) [PPT]](http://www.bibbase.org/resources/filetypes/)
|
A Heuristic Search Approach to Planning with Temporally Extended Preferences. Baier, J. A.; Bacchus, F.; and McIlraith, S. A. 2007.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), 1808-1815.
|
GAC Via Unit Propagation. Bacchus, F. 2007.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), 133-147.
|
|
|
| 2006 (3) |
|
CSPs: Adding Structure to SAT (Invited Talk). Bacchus, F. 2006.
In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT-2006), 10-10.
|
Preprocessing QBF. Samulowitz, H.; Davies, J.; and Bacchus, F. 2006.
In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP-2006), 514-529.
|
Binary Clause Reasoning in QBF. Samulowitz, H., and Bacchus, F. 2006.
In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT-2006), 353-367.
|
|
|
| 2005 (5) |
|
Using SAT in QBF. Samulowitz, H., and Bacchus, F. 2005.
In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP-2005), 578-592.
|
Propagating Logical Combinations of Constraints. Bacchus, F., and Walsh, T. 2005.
In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-2005), 35-40.
|
Generalized NoGoods in CSPs. Katsirelos, G., and Bacchus, F. 2005.
In Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI-2005), 390-396.
|
21st Conference on Uncertainty in Artificial Intelligence, UAI 2005, Edinburgh, Scotland. Bacchus, F., and Jaakkola, T. 2005.
Brightdoc On-Line Demand Publishers.
|
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St Andrews, UK, June 19-23, 2005. Bacchus, F., and Walsh, T. 2005.
Springer, Lecture Notes in Computer Science, 3569, 3-540-26276-8.
|
|
|
| 2004 (5) |
|
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. Petrick, R. P. A., and Bacchus, F. 2004.
In Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR-2004), 613-622.
|
Solving Non-clausal Formulas with DPLL Search. Thiffault, C.; Bacchus, F.; and Walsh, T. 2004.
In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP-2004), 663-678.
|
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. Petrick, R. P. A., and Bacchus, F. 2004.
In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-2004), 2-11.
|
Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning. Hyafil, N., and Bacchus, F. 2004.
In Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI-2004), 1033-1034.
|
Combining Component Caching and Clause Learning for Effective Model Counting. Sang, T.; Bacchus, F.; Beame, P.; Kautz, H. A.; and Pitassi, T. 2004.
In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT-2004).
|
|
|
| 2003 (7) |
|
Value Elimination: Bayesian Inference via Backtracking Search. Bacchus, F.; Dalmao, S.; and Pitassi, T. 2003.
In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence August (UAI-2003), 20-28.
|
Generalizing GraphPlan by Formulating Planning as a CSP. Lopez, A., and Bacchus, F. 2003.
In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), 954-960.
|
Effective Preprocessing with Hyper-Resolution and Equality Reduction. Bacchus, F., and Winter, J. 2003.
In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT-2003), 341-355.
|
The Power of Modeling - a Response to PDDL2.1. Bacchus, F. 2003.
J. Artif. Intell. Res. (JAIR), 20:125-132.
|
Conformant Probabilistic Planning via CSPs. Hyafil, N., and Bacchus, F. 2003.
In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-2003), 205-214.
|
Algorithms and Complexity Results for #SAT and Bayesian Inference. Bacchus, F.; Dalmao, S.; and Pitassi, T. 2003.
In Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS-2003), 340-351.
|
Unrestricted Nogood Recording in CSP Search. Katsirelos, G., and Bacchus, F. 2003.
In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-2003), 873-877.
|
|
|
| 2002 (3) |
|
Binary vs. non-binary constraints. Bacchus, F.; Chen, X.; Beek, P. van ; and Walsh, T. 2002.
Artif. Intell., 140(1/2):1-37.
|
Enhancing Davis Putnam with Extended Binary Clause Reasoning. Bacchus, F. 2002.
In Proceedings of the 18th AAAI Conference on Artificial Intelligence (AAAI-2002), 613-619.
|
A Knowledge-Based Approach to Planning with Incomplete Information and Sensing. Petrick, R. P. A., and Bacchus, F. 2002.
In Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems (AIPS-2002), 212-222.
|
|
|
| 2001 (4) |
|
The AIPS '00 Planning Competition. Bacchus, F. 2001.
AI Magazine, 22(3):47-56.
|
Planning with Resources and Concurrency: A Forward Chaining Approach. Bacchus, F., and Ady, M. 2001.
In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-2001), 417-424.
|
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. Boutilier, C.; Bacchus, F.; and Brafman, R. I. 2001.
In Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI-2001), 56-64.
|
GAC on Conjunctions of Constraints. Katsirelos, G., and Bacchus, F. 2001.
In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP-2001), 610-614.
|
|
|
| 2000 (3) |
|
Extending Forward Checking. Bacchus, F. 2000.
In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP-2000), 35-51.
|
Using temporal logics to express search control knowledge for planning. Bacchus, F., and Kabanza, F. 2000.
Artif. Intell., 116(1-2):123-191.
|
Inner and Outer Boundaries of Literals: A Mechanism for Computing Domain Specific Information. Bacchus, F., and Fraser, C. B. 2000.
In AIPS-2000 Workshop on Analysing and Exploiting Domain Knowledge for Efficient Planning.
|
|
|
| 1999 (3) |
|
Evaluating First Order Formulas---the foundation for a general Search Engine. Bacchus, F., and Ady, M. 1999.
Unpublished.
|
Reasoning about Noisy Sensors and Effectors in the Situation Calculus. Bacchus, F.; Halpern, J. Y.; and Levesque, H. J. 1999.
Artif. Intell., 111(1-2):171-208.
|
Precondition Control. Bacchus, F., and Ady, M. 1999.
Unpublished.
|
|
|
| 1998 (4) |
|
Modeling an Agent's Incomplete Knowledge During Planning and During Execution. Bacchus, F., and Petrick, R. P. A. 1998.
In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-1998), 432-443.
|
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. Bacchus, F., and Beek, P. van 1998.
In Proceedings of the 15th AAAI Conference on Artificial Intelligence (AAAI-1998), 310-318.
|
Planning for Temporally Extended Goals. Bacchus, F., and Kabanza, F. 1998.
Ann. Math. Artif. Intell., 22(1-2):5-27.
|
Making Forward Chaining Relevant. Bacchus, F., and Teh, Y. W. 1998.
In Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems (AIPS-1998), 54-61.
|
|
|
| 1997 (1) |
|
Structured Solution Methods for Non-Markovian Decision Processes. Bacchus, F.; Boutilier, C.; and Grove, A. J. 1997.
In Proceedings of the 14th AAAI Conference on Artificial Intelligence (AAAI-1997), 112-117.
|
|
|
| 1996 (5) |
|
Utility Independence in a Qualitative Decision Theory. Bacchus, F., and Grove, A. J. 1996.
In Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR-1996), 542-552.
|
Planning for Temporally Extended Goals. Bacchus, F., and Kabanza, F. 1996.
In Proceedings of the 13th AAAI Conference on Artificial Intelligence (AAAI-1996), 1215-1222.
|
From Statistical Knowledge Bases to Degrees of Belief. Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1996.
Artif. Intell., 87(1-2):75-143.
|
Using Temporal Logics for Planning and Control. Bacchus, F. 1996.
In Proceedings of the 3rd International Workshop on Temporal Representation and Reasoning (TIME-1996), 2-3.
|
Rewarding Behaviors. Bacchus, F.; Boutilier, C.; and Grove, A. J. 1996.
In Proceedings of the 13th AAAI Conference on Artificial Intelligence (AAAI-1996), 1160-1167.
|
|
|
| 1995 (4) |
|
On the Forward Checking Algorithm. Bacchus, F., and Grove, A. J. 1995.
In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP-1995), 292-308.
|
Dynamic Variable Ordering in CSPs. Bacchus, F., and Run, P. van 1995.
In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP-1995), 258-275.
|
Reasoning about Noisy Sensors in the Situation Calculus. Bacchus, F.; Halpern, J. Y.; and Levesque, H. J. 1995.
In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), 1933-1940.
|
Graphical models for preference and utility. Bacchus, F., and Grove, A. J. 1995.
In Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence (UAI-1995), 3-10.
|
|
|
| 1994 (6) |
|
Downward Refinement and the Efficiency of Hierarchical Problem Solving. Bacchus, F., and Yang, Q. 1994.
Artif. Intell., 71(1):43-100.
|
Using New Data to Refine a Bayesian Network. Lam, W., and Bacchus, F. 1994.
In Proceedings of the 10th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1994), 383-390.
|
A Response to "Believing on the Basis of the Evidence". Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1994.
Computational Intelligence, 10:21-25.
|
Learning Bayesian Belief Networks: An Approach Based on the MDL Principle. Lam, W., and Bacchus, F. 1994.
Computational Intelligence, 10:269-294.
|
Forming Beliefs about a Changing World. Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1994.
In Proceedings of the 12th AAAI Conference on Artificial Intelligence (AAAI-1994), 222-229.
|
Generating New Beliefs from Old. Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1994.
In Proceedings of the 10th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1994), 37-45.
|
|
|
| 1993 (4) |
|
Generating Degrees of Belief from Statistical Information: An Overview. Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1993.
In Proceedings of the 13th Conference n Foundations of Software Technology and Theoretical Computer Science, 318-325.
|
Using Causal Information and Local Measures to Learn Bayesian Networks. Lam, W., and Bacchus, F. 1993.
In Proceedings of the 9th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1993), 243-250.
|
Using First-Order Probability Logic for the Construction of Bayesian Networks. Bacchus, F. 1993.
In Proceedings of the 9th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1993), 219-226.
|
Statistical Foundations for Default Reasoning. Bacchus, F.; Grove, A. J.; Halpern, J. Y.; and Koller, D. 1993.
In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-2007), 563-569.
|
|
|
| 1992 (3) |
|
The Expected Value of Hierarchical Problem-Solving. Bacchus, F., and Yang, Q. 1992.
In Proceedings of the 11th AAAI Conference on Artificial Intelligence (AAAI-1991), 369-374.
|
From Statistics to Beliefs. Bacchus, F.; Grove, A. J.; Koller, D.; and Halpern, J. Y. 1992.
In Proceedings of the 11th AAAI Conference on Artificial Intelligence (AAAI-1991), 602-608.
|
Learning Bayesian Belief Networks. Lam, W., and Bacchus, F. 1992.
In Proceedings of the Pacific Rim Conference on Atificial Intelligence (PRICAI-92), 1237-1243.
|
|
|
| 1991 (3) |
|
The Downward Refinement Property. Bacchus, F., and Yang, Q. 1991.
In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-1991), 286-293.
|
Default Reasoning From Statistics. Bacchus, F. 1991.
In Proceedings of the 10th AAAI Conference on Artificial Intelligence (AAAI-1991), 392-398.
|
A Non-Reified Temporal Logic. Bacchus, F.; Tenenberg, J. D.; and Koomen, J. A. G. M. 1991.
Artif. Intell., 52(1):87-108.
|
|
|
| 1990 (5) |
|
Lp---a logic for representing and reasoning with statistical knowledge. Bacchus, F. 1990.
Computational Intelligence, 6:209-231.
|
Representing and Reasoning with Probabilistic Knowledge. Bacchus, F. 1990.
MIT Press.
|
Probability and logic: a reply to Cheeseman. Bacchus, F. 1990.
Computational Intelligence, 6:180-183.
|
Against Conditionalization. Bacchus, F.; Jr., H. E. K.; and Thalos, M. 1990.
Synthese, 85:475-506.
|
Probabilistic Belief Logics. Bacchus, F. 1990.
In Proceedings of the 9th Eureopean Conference on Artificial Intelligence (ECAI-1990), 59-64.
|
|
|
| 1989 (3) |
|
Lp: A Logic for Statistical Information. Bacchus, F. 1989.
In Proceedings of the 5th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1989), 3-14.
|
A Non-Reified Temporal Logic. Bacchus, F.; Tenenberg, J. D.; and Koomen, J. A. G. M. 1989.
In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-1989), 2-10.
|
A Modest but Semantically Well Founded Inheritance Reasoner. Bacchus, F. 1989.
In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-1989), 1104-1109.
|
|
|
| 1988 (2) |
|
Statistically Founded Degrees of Belief. Bacchus, F. 1988.
In Proceedings Biennial conference on Artificial Intelligence sponsored by the Canadian Society for Computational Studies of Intelligence (CSCSI-1988), 56-66.
|
On probability distributions over possible worlds. Bacchus, F. 1988.
In Proceedings of the 4th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1988), 217-226.
|
|
|
| Link To This Page. |
RSS Feed