Sciweavers

443 search results - page 66 / 89
» SAT-Based Answer Set Programming
Sort
View
UM
2001
Springer
14 years 9 days ago
Utility-Based Decision Tree Optimization: A Framework for Adaptive Interviewing
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
Markus Stolze, Michael Ströbel
ICLP
2003
Springer
14 years 1 months ago
Argumentation Databases
We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set ...
Shekhar Pradhan
VMCAI
2007
Springer
14 years 2 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
FOCS
2005
IEEE
14 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
LPNMR
2001
Springer
14 years 10 days ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä