Titlebook: Logic Based Program Synthesis and Transformation; 12th International W Michael Leuschel Conference proceedings 2003 Springer-Verlag Berlin

Constrain

Translating Datalog-Like Optimization Queries into ILOG Programsatalog with constraints and allows disjunction to define nondeterministically partitions of relations. It’s well known that . search problems can be formulated as unstratified DATALOG queries under nondeterministic stable model semantics so that each stable model corresponds to a possible solution.

prosthesis

Tabling Structures for Bottom-Up Logic Programmingrammer-defined data structures - such as lists in Prolog. Logic programs often become saturated with data structure manipulation code which obscures the original problem and requires large-scale rewriting to change data representations. To avoid this, the logic programming language Starlog provides

violate

A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Propertiesose a new (infinite) domain ShLin. which can be thought of as a general framework from which other domains can be easily derived by abstraction. The advantage is that ShLin. is endowed with very elegant and optimal abstract operators for unification and matching, based on a new concept of . which pl

Synapse

莎草

grovel

Interdict

臨時(shí)抱佛腳

Refinement of Higher-Order Logic Programss specification. In this paper we extend the refinement calculus for logic programs to include higher-order programming capabilities in specifications and programs, such as procedures as terms and lambda abstraction. We use a higher-order type and term system to describe programs, and provide a sema

Indicative

Justification Based on Program Transformationis truth. Justification plays a fundamental role in automatic verification, especially model checking [1]. For instance it can be used for efficient generation of parse trees, synthesis controllers for embedded systems [7], etc.

Diuretic