Sciweavers

13 search results - page 3 / 3
» The Power of Verification for One-Parameter Agents
Sort
View
AAAI
2008
13 years 7 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
CLIMA
2006
13 years 6 months ago
Answer Set Programming for Representing and Reasoning About Virtual Institutions
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in oth...
Owen Cliffe, Marina De Vos, Julian A. Padget
AAAI
2008
13 years 7 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor