Sciweavers

4743 search results - page 676 / 949
» The PlusCal Algorithm Language
Sort
View
ICLP
2009
Springer
14 years 10 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
ICLP
2009
Springer
14 years 10 months ago
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based charac...
Martin Gebser, Roland Kaminski, Benjamin Kaufmann,...
CP
2009
Springer
14 years 10 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 10 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 9 months ago
Mining long-term search history to improve search accuracy
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
Bin Tan, Xuehua Shen, ChengXiang Zhai