On the public citation graph

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferredcites →https://doi.org/10.1007/11513988_11openalex-snapshot
Abstraction Refinement for Bounded Model Checking
inferredcites →https://doi.org/10.1007/3-540-44829-2_13openalex-snapshot
Promela Planning
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/3-540-63912-8openalex-snapshot
Recent Advances in AI Planning
inferredcites →https://doi.org/10.1007/3-540-63912-8_92openalex-snapshot
Extending planning graphs to an ADL subset
inferredcites →https://doi.org/10.1007/3-540-63912-8_97openalex-snapshot
Ignoring irrelevant facts and operators in plan generation
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_26openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/j.artint.2006.08.002openalex-snapshot
Planning as satisfiability: parallel plans and algorithms for plan search
inferredcites →https://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferredcites →https://doi.org/10.1016/j.artint.2008.11.004openalex-snapshot
Long-distance mutual exclusion for planning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1016/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1109/icse.2003.1201217openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1109/tse.2004.22openalex-snapshot
Modular verification of software components in C
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/381694.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.1184/r1/6603947openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
inferredcites →https://doi.org/10.1613/jair.1677openalex-snapshot
The Deterministic Part of IPC-4: An Overview
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.1613/jair.737openalex-snapshot
On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
inferredcites →https://doi.org/10.2168/lmcs-3(1:6)2007openalex-snapshot
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103608openalex-snapshot
A framework for analysing state-abstraction methods
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8012openalex-snapshot
Exploiting Path Refinement Abstraction in Domain Transition Graphs
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18391openalex-snapshot
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications
inferred← citeshttps://doi.org/10.1613/jair.1.13431openalex-snapshot
A Logic-Based Explanation Generation Framework for Classical and Hybrid Planning Problems
inferred← citeshttps://doi.org/10.1613/jair.3063openalex-snapshot
Implicit Abstraction Heuristics
inferred← citeshttps://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferred← citeshttps://doi.org/10.24963/ijcai.2022/641openalex-snapshot
Explaining Soft-Goal Conflicts through Constraint Relaxations
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-745openalex-snapshot
Relative-Order Abstractions for the Pancake Problem
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.