3566 search results - page 543 / 714 » Signed Logic Programs |
149
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
150
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
121
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...
121
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
123
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...