Logic-Based Program Synthesis and Transformation 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers /
Logic-Based Program Synthesis and Transformation 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers / [electronic resource] :
edited by Danny De Schreye.
- 1st ed. 2010.
- X, 205 p. 29 illus. online resource.
- Theoretical Computer Science and General Issues, 6037 2512-2029 ; .
- Theoretical Computer Science and General Issues, 6037 .
Towards Scalable Partial Evaluation of Declarative Programs -- Deciding Full Branching Time Logic by Program Transformation -- A Transformational Approach for Proving Properties of the CHR Constraint Store -- The Dependency Triple Framework for Termination of Logic Programs -- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing -- LP with Flexible Grouping and Aggregates Using Modes -- On Inductive and Coinductive Proofs via Unfold/Fold Transformations -- Coinductive Logic Programming with Negation -- Refining Exceptions in Four-Valued Logic -- Towards a Framework for Constraint-Based Test Case Generation -- Using Rewrite Strategies for Testing BUpL Agents -- Towards Just-In-Time Partial Evaluation of Prolog -- Program Parallelization Using Synchronized Pipelining -- Defining Datalog in Rewriting Logic.
9783642125928
10.1007/978-3-642-12592-8 doi
Computer programming.
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Artificial intelligence.
Programming Techniques.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Artificial Intelligence.
QA76.6-76.66
005.11
Towards Scalable Partial Evaluation of Declarative Programs -- Deciding Full Branching Time Logic by Program Transformation -- A Transformational Approach for Proving Properties of the CHR Constraint Store -- The Dependency Triple Framework for Termination of Logic Programs -- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing -- LP with Flexible Grouping and Aggregates Using Modes -- On Inductive and Coinductive Proofs via Unfold/Fold Transformations -- Coinductive Logic Programming with Negation -- Refining Exceptions in Four-Valued Logic -- Towards a Framework for Constraint-Based Test Case Generation -- Using Rewrite Strategies for Testing BUpL Agents -- Towards Just-In-Time Partial Evaluation of Prolog -- Program Parallelization Using Synchronized Pipelining -- Defining Datalog in Rewriting Logic.
9783642125928
10.1007/978-3-642-12592-8 doi
Computer programming.
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Artificial intelligence.
Programming Techniques.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Artificial Intelligence.
QA76.6-76.66
005.11