Sciweavers

448 search results - page 67 / 90
» Answer Set Programming: A Primer
Sort
View
VMCAI
2007
Springer
15 years 9 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
15 years 8 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
15 years 7 months 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ä
ICTAI
2008
IEEE
15 years 9 months ago
The System BioC for Reasoning about Biological Models in Action Language C
We elaborate upon the usage of action language C for representing and reasoning about biological models. First, we provide a simple extension of C allowing for variables and show ...
Steve Dworschak, Torsten Grote, Arne König, T...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 10 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin