Structured Traversal of Search Trees in Constraint-Logic Object-Oriented Programming

Dageförde, Jan C.; Teegen, Finn

doi:10.1007/978-3-030-46714-2_13

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eventually, the runtime environment considers all alternative decisions. The result is a (conceptual) search tree, in which the inner nodes correspond to the points at which decisions can be taken, with one subtree per decision alternative [7]. The eventual outcomes of execution (in particular, returned values and thrown exceptions) are the leaves of the tree.…”

Section: Constraint-logic Object-oriented Programming With Mulimentioning

confidence: 99%

“…The MLVM is a custom Java virtual machine with support for symbolic execution of Java/Muli bytecode and non-deterministic execution of search regions. The MLVM represents non-deterministic execution in a search tree, in which the inner nodes are Choice nodes (with one subtree per alternative decision that can be taken) and the leaf nodes are outcomes of search, i. e., solutions or failures [7]. Executing a bytecode instruction with non-deterministic behaviour results in the creation of a Choice node that is added to the search tree.…”

Section: Constraint-logic Object-oriented Programming With Mulimentioning

confidence: 99%

See 1 more Smart Citation

Constraint-Logic Object-Oriented Programming with Free Arrays

Dageförde¹,

Kuchen²

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Constraint-logic object-oriented programming provides a useful symbiosis between object-oriented programming and constraint-logic search. The ability to use logic variables, constraints, non-deterministic search, and object-oriented programming in an integrated way facilitates the combination of search-related program parts and other business logic in object-oriented applications. With this work we conceptualize arraytyped logic variables ("free arrays"), thus completing the set of types that logic variables can assume in constraint-logic object-oriented programming. Free arrays exhibit interesting properties, such as indeterminate lengths and non-deterministic accesses to array elements.

show abstract

Section: Constraint-logic Object-oriented Programming With Mulimentioning

confidence: 99%

Section: Constraint-logic Object-oriented Programming With Mulimentioning

confidence: 99%