Sciweavers

IJCAI
2001
13 years 6 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
IJCAI
2001
13 years 6 months ago
Learning Procedural Knowledge to Better Coordinate
A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This paper presents techniques that allow heterogeneous agent...
Andrew Garland, Richard Alterman
IJCAI
2001
13 years 6 months ago
Reasoning about Categories in Conceptual Spaces
Understanding the process of categorization is a primary research goal in artificial intelligence. The conceptual space framework provides a flexible approach to modeling context-...
Peter Gärdenfors, Mary-Anne Williams
IJCAI
2001
13 years 6 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
IJCAI
2001
13 years 6 months ago
A Framework for Declarative Update Specifications in Logic Programs
Recently, several approaches for updating knowledge bases represented as logic programs have been proposed. In this paper, we present a generic framework for declarative specifica...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
IJCAI
2001
13 years 6 months ago
Multi-Agent Systems by Incremental Gradient Reinforcement Learning
Alain Dutech, Olivier Buffet, François Char...
IJCAI
2001
13 years 6 months ago
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
Of late, new insight into the study of random -SAT
Olivier Dubois, Gilles Dequen
IJCAI
2001
13 years 6 months ago
Preference-Based Configuration of Web Page Content
Abstract. In this paper we present a new approach for personalized presentation of web-page content. The model is defined as a preference-based configuration process that is based ...
Carmel Domshlak, Ronen I. Brafman, Solomon Eyal Sh...
IJCAI
2001
13 years 6 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...