Sciweavers

15 search results - page 3 / 3
» Credulous Resolution for Answer Set Programming
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 4 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
SEMWEB
2010
Springer
13 years 2 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 10 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
JUCS
2006
135views more  JUCS 2006»
13 years 4 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
HICSS
2002
IEEE
138views Biometrics» more  HICSS 2002»
13 years 9 months ago
Artificial Computer-Assisted International Negotiation: A Tool for Research and Practice
We propose a web-based computer-assisted tool for diagnosing progress in international negotiation. The system is based on a general linear model. Innovative features of the progr...
Daniel Druckman, Richard Harris, Bennett Ramberg