Sciweavers

446 search results - page 22 / 90
» A new paradigm for programming competitions
Sort
View
JAIR
2007
132views more  JAIR 2007»
13 years 8 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
Chu Min Li, Felip Manyà, Jordi Planes
FSS
2008
145views more  FSS 2008»
13 years 8 months ago
A logic programming framework for possibilistic argumentation: Formalization and logical properties
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has s...
Teresa Alsinet, Carlos Iván Chesñeva...
AGP
2010
IEEE
14 years 1 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
CP
2005
Springer
14 years 2 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ICPADS
1996
IEEE
14 years 27 days ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy