On the public citation graph
An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant Planning
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11562931_7openalex-snapshot
Towards an Integration of Answer Set and Constraint Solving
inferredcites →https://doi.org/10.1007/3-540-40006-0_4openalex-snapshot
Semi-qualitative Reasoning about Distances: A Preliminary Report
inferredcites →https://doi.org/10.1007/3-540-45757-7_10openalex-snapshot
Polynomial-Length Planning Spans the Polynomial Hierarchy
inferredcites →https://doi.org/10.1007/978-1-4615-1567-8openalex-snapshot
Logic-Based Artificial Intelligence
inferredcites →https://doi.org/10.1007/978-1-4615-1567-8_12openalex-snapshot
Reasoning Agents in Dynamic Domains
inferredcites →https://doi.org/10.1007/978-3-540-24609-1_32openalex-snapshot
Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_17openalex-snapshot
Stable Models and an Alternative Logic Programming Paradigm
inferredcites →https://doi.org/10.1007/s10472-006-9026-1openalex-snapshot
Answer set based design of knowledge systems
inferredcites →https://doi.org/10.1016/0743-1066(93)90035-fopenalex-snapshot
Representing action and change by logic programs
inferredcites →https://doi.org/10.1016/j.artint.2004.05.003openalex-snapshot
Conformant planning via symbolic model checking and heuristic search
inferredcites →https://doi.org/10.1016/j.artint.2005.05.004openalex-snapshot
In defense of PDDL axioms
inferredcites →https://doi.org/10.1016/s0004-3702(00)00043-6openalex-snapshot
Computational complexity of planning and approximate planning in the presence of incompleteness
inferredcites →https://doi.org/10.1016/s0004-3702(00)00080-1openalex-snapshot
Formalizing sensing actions— A transition function based approach
inferredcites →https://doi.org/10.1016/s0004-3702(02)00186-8openalex-snapshot
Answer set programming and plan generation
inferredcites →https://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferredcites →https://doi.org/10.1016/s0004-3702(02)00367-3openalex-snapshot
A logic programming approach to knowledge-state planning, II: The system
inferredcites →https://doi.org/10.1016/s0004-3702(02)00375-2openalex-snapshot
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
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(97)00037-4openalex-snapshot
Representing action: indeterminacy and ramifications
inferredcites →https://doi.org/10.1016/s0004-3702(97)00057-xopenalex-snapshot
On the logic of causal explanation
inferredcites →https://doi.org/10.1016/s0004-3702(99)00071-5openalex-snapshot
Using temporal logics to express search control knowledge for planning
inferredcites →https://doi.org/10.1016/s0004-3702(99)00087-9openalex-snapshot
Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)
inferredcites →https://doi.org/10.1017/cbo9780511543357openalex-snapshot
Knowledge Representation, Reasoning and Declarative Problem Solving
inferredcites →https://doi.org/10.1017/s1471068403001807openalex-snapshot
Diagnostic reasoning with A-Prolog
inferredcites →https://doi.org/10.1111/j.1467-8640.1987.tb00183.xopenalex-snapshot
A critique of pure reason1
inferredcites →https://doi.org/10.1145/1183278.1183279openalex-snapshot
Domain-dependent knowledge in answer set planning
inferredcites →https://doi.org/10.1609/aimag.v22i3.1571openalex-snapshot
AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
inferredcites →https://doi.org/10.1613/jair.1869openalex-snapshot
Planning Graph Heuristics for Belief Space Search
inferredcites →https://doi.org/10.1613/jair.774openalex-snapshot
Conformant Planning via Symbolic Model Checking
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0014openalex-snapshot
Splitting a Logic Program
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_3openalex-snapshot
Answer Set Programming and Its Applications in Planning and Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_28openalex-snapshot
An Approximative Inference Method for Solving ∃ ∀SO Satisfiability Problems
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.007openalex-snapshot
Approximation of action theories and its application to conformant planning
inferred← citeshttps://doi.org/10.1017/s1471068420000289openalex-snapshot
Modelling Multi-Agent Epistemic Planning in ASP
inferred← citeshttps://doi.org/10.1017/s1471068421000259openalex-snapshot
Planning with Incomplete Information in Quantified Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068422000072openalex-snapshot
Answer Set Planning: A Survey
inferred← citeshttps://doi.org/10.1145/2438653.2438671openalex-snapshot
A conformant planner based on approximation
inferred← citeshttps://doi.org/10.1613/jair.3658openalex-snapshot
An approximative inference method for solving ∃∀SO satisfiability problems
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.