Inverse Unfold Problem and Its Heuristic Solving
From MaRDI portal
Recommendations
- An algorithm to solve the inverse IFS-problem
- Solution structure of some inverse combinatorial optimization problems
- Inverse problems of some NP-complete problems
- Mathematical Foundations of Computer Science 2003
- Inverse NP problems
- scientific article; zbMATH DE number 4159507
- The Inverse Satisfiability Problem
- Principles of inverse computation and the universal resolving algorithm
- The inverse Banzhaf problem
Cites work
- A method for automatic program inversion based on LR(0) parsing
- A parameterized unfold/fold transformation framework for definite logic programs
- A transformation system for deductive database modules with perfect model semantics
- A Transformation System for Developing Recursive Programs
- Advanced topics in term rewriting
- 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
- Difference matching
- Equivalence-preserving first-order unfold/fold transformation systems
- Improving determinization of grammar programs for program inversion
- Order-sorted completion: The many-sorted way
- Partial inversion of constructor term rewriting systems
- Program inversion for tail recursive functions
- Term Rewriting and All That
- Transformation rules for locally stratified constraint logic programs
- 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)
