Sciweavers

808 search results - page 93 / 162
» What Is Answer Set Programming
Sort
View
VMCAI
2007
Springer
14 years 3 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 2 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...
SEMWEB
2004
Springer
14 years 2 months ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
AI
2003
Springer
14 years 2 months ago
Negotiating Exchanges of Private Information for Web Service Eligibility
Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future par...
Keping Jia, Bruce Spencer
PPDP
2009
Springer
14 years 3 months ago
Automatic refactoring of Erlang programs
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
Konstantinos F. Sagonas, Thanassis Avgerinos