622 search results - page 64 / 125 » Answer Set Programming and Bounded Model Checking |
IPPS
1998
IEEE
14 years 10 days ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
TCAD
2008
13 years 8 months ago
2008
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
COLT
1992
Springer
14 years 5 days ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...