Inverse Unfold Problem and Its Heuristic Solving

DOI10.4230/OASICS.WPTE.2014.27MaRDI QIDQ5240134zbMATH OpenOpenAlexFDO

Authors Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, Naoki Nishida

Publication date 24 October 2019

Full work available at URL https://dblp.uni-trier.de/db/conf/rta/wpte2014.html#NagashimaKSN14

zbMATH Keywords

conditional term rewriting systemprogram transformationunfolding

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1985234
• Solution structure of some inverse combinatorial optimization problems
• Algorithmic Applications in Management
• Mathematical Foundations of Computer Science 2003
• Inverse NP problems
• scientific article; zbMATH DE number 4159507
• The Inverse Satisfiability Problem
• scientific article; zbMATH DE number 1953282
• The inverse Banzhaf problem

Cites work

• A method for automatic program inversion based on LR(0) parsing
• A transformation system for deductive database modules with perfect model semantics
• A Transformation System for Developing Recursive Programs
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• Completeness results for basic narrowing
• Computing more specific versions of conditional rewriting systems
• Conditional rewrite rules: Confluence and termination
• Constraint-based correctness proofs for logic program transformations
• Determinization of conditional term rewriting systems
• Equivalence-preserving first-order unfold/fold transformation systems
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 1348478 (Why is no real title available?)
• scientific article; zbMATH DE number 1487848 (Why is no real title available?)
• Improving determinization of grammar programs for program inversion
• Order-sorted completion: The many-sorted way
• Program Development in Computational Logic
• Program inversion for tail recursive functions
• Term Rewriting and All That
• Term Rewriting and Applications
• Transformations of CLP modules
• Transforming constraint logic programs
• Unfold⧸fold transformation of general logic programs for the well-founded semantics

This page was built for publication: Inverse Unfold Problem and Its Heuristic Solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240134)