Sciweavers

149 search results - page 27 / 30
» Encoding Planning Problems in Nonmonotonic Logic Programs
Sort
View
CP
2003
Springer
14 years 19 days ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
PLDI
2009
ACM
14 years 2 days ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
JNSM
2008
130views more  JNSM 2008»
13 years 7 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
ICAI
2004
13 years 8 months ago
Automatic Generation of English-language Steps in Puzzle Solving
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
Hemantha Ponnuru, Raphael A. Finkel, Victor W. Mar...
PLDI
2006
ACM
14 years 1 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann