Sciweavers

622 search results - page 114 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
103
Voted
SOFTVIS
2003
ACM
15 years 7 months ago
Nice Class Diagrams Admit Good Design?
Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods accordin...
Holger Eichelberger
CP
2007
Springer
15 years 8 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 8 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
146
Voted
CCS
2011
ACM
14 years 1 months ago
Automatic error finding in access-control policies
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
Karthick Jayaraman, Vijay Ganesh, Mahesh V. Tripun...
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 1 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird