884 search results - page 83 / 177 » Using Nested Logic Programs for Answer Set Programming |
138
click to vote
PPDP
2010
Springer
15 years 19 days ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
146
click to vote
ASP
2001
Springer
15 years 6 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
141
click to vote
COMMA
2010
14 years 9 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
132
click to vote
FOSSACS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
116
click to vote
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
Taint analysis, a form of information-flow analysis, establishes whether values from untrusted methods and parameters may flow into security-sensitive operations. Taint analysis...