2012
DOI: 10.1007/978-3-642-29822-6_16
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. The latter infers conditions sufficient to ensure that if one clause yields an answer then another cannot. This pa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2013
2013

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
(35 reference statements)
0
1
0
Order By: Relevance
“…18). Several approaches for determinacy analysis have been developed (e.g., [24,25,26,27,28,33]). Moreover, determinacy analysis is also needed for complexity analysis to detect nondeterministic Split nodes in Thm.…”
Section: Evaluation Graphs For Determi-nacy Analysismentioning
confidence: 99%
“…18). Several approaches for determinacy analysis have been developed (e.g., [24,25,26,27,28,33]). Moreover, determinacy analysis is also needed for complexity analysis to detect nondeterministic Split nodes in Thm.…”
Section: Evaluation Graphs For Determi-nacy Analysismentioning
confidence: 99%