Sciweavers

579 search results - page 52 / 116
» Combined reasoning by automated cooperation
Sort
View
LPAR
2010
Springer
13 years 7 months ago
Partitioning SAT Instances for Distributed Solving
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ECSQARU
2009
Springer
13 years 6 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
LICS
2012
IEEE
11 years 11 months ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...
Deepak Garg, Valerio Genovese, Sara Negri
ICLP
2009
Springer
14 years 9 months ago
Constraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
Martin Gebser, Max Ostrowski, Torsten Schaub
ICLP
2009
Springer
14 years 9 months ago
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
Tran Cao Son, Enrico Pontelli, Chiaki Sakama