On the public citation graph

Answer Set Planning Under Action Costs

0 signed · 68 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/0-387-34241-9_4openalex-snapshot
The Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/3-540-44957-4_54openalex-snapshot
Planning under Incomplete Knowledge
inferredcites →https://doi.org/10.1007/3-540-45612-0_4openalex-snapshot
Beyond the Plan-Length Criterion
inferredcites →https://doi.org/10.1007/3-540-45757-7_16openalex-snapshot
Answer Set Planning under Action Costs
inferredcites →https://doi.org/10.1007/3-540-45757-7_31openalex-snapshot
Reasoning about Actions in Prioritized Default Theory
inferredcites →https://doi.org/10.1007/3-540-46767-x_28openalex-snapshot
Answer Set Planning
inferredcites →https://doi.org/10.1007/3-540-46767-x_7openalex-snapshot
Representing Transition Systems by Logic Programs
inferredcites →https://doi.org/10.1007/3-540-63255-7_2openalex-snapshot
Strong and weak constraints in disjunctive datalog
inferredcites →https://doi.org/10.1007/3-540-63912-8_84openalex-snapshot
Encoding planning problems in nonmonotonic logic programs
inferredcites →https://doi.org/10.1007/978-1-4615-1567-8_4openalex-snapshot
Declarative Problem-Solving Using the DLV System
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_16openalex-snapshot
Action Languages, Answer Sets, and Planning
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/0304-3975(92)90073-oopenalex-snapshot
Generalizations of Opt P to the polynomial hierarchy
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(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/s0022-0000(05)80009-1openalex-snapshot
A taxonomy of complexity classes of functions
inferredcites →https://doi.org/10.1023/a:1018930122475openalex-snapshot
Logic programs with stable model semantics as a constraint programming paradigm
inferredcites →https://doi.org/10.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferredcites →https://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferredcites →https://doi.org/10.1145/976706.976708openalex-snapshot
A logic programming approach to knowledge-state planning
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.48550/arxiv.cs/0003036openalex-snapshot
DLV - A System for Declarative Problem Solving
inferredcites →https://doi.org/10.48550/arxiv.cs/0112006openalex-snapshot
A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0030openalex-snapshot
Relating Stable Models and AI Planning Domains
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/3-540-45757-7_51openalex-snapshot
The DLVK Planning System: Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_15openalex-snapshot
Explaining Actual Causation via Reasoning About Actions and Change
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_42openalex-snapshot
Optimal Planning with Expressive Action Languages as Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-45468-9_1openalex-snapshot
Resource Allocation with Dependencies in Business Process Management Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_22openalex-snapshot
Planning with Preferences Using Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24836-1_10openalex-snapshot
USA-Smart: Improving the Quality of Plans in Answer Set Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-24840-8_48openalex-snapshot
A Unified Action Language Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-39451-8_36openalex-snapshot
Planning in Answer Set Programming Using Ordered Task Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-39451-8_47openalex-snapshot
Monitoring Agents Using Declarative Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_10openalex-snapshot
The DLV Project: A Tour from Theory and Research to Applications and Market
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_37openalex-snapshot
Representing Multi-agent Planning in CLP
inferred← citeshttps://doi.org/10.1007/978-3-642-11355-0_13openalex-snapshot
Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-16867-3_1openalex-snapshot
Planning for Multiagent Using ASP-Prolog
inferred← citeshttps://doi.org/10.1007/s10472-006-9026-1openalex-snapshot
Answer set based design of knowledge systems
inferred← citeshttps://doi.org/10.1007/s10489-017-0936-xopenalex-snapshot
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic
inferred← citeshttps://doi.org/10.1007/s10846-018-0971-9openalex-snapshot
Robotic Task Planning Using a Backchaining Theorem Prover for Multiplicative Exponential First-Order Linear Logic
inferred← citeshttps://doi.org/10.1007/s10994-018-5712-6openalex-snapshot
Learning efficient logic programs
inferred← citeshttps://doi.org/10.1007/s11432-013-4854-1openalex-snapshot
Proof systems for planning under 0-approximation semantics
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferred← citeshttps://doi.org/10.1016/j.artint.2009.11.016openalex-snapshot
Logic programs with abstract constraint atoms: The role of computations
inferred← citeshttps://doi.org/10.1016/j.artint.2010.08.004openalex-snapshot
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2010.11.021openalex-snapshot
Specifying and computing preferred plans
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.001openalex-snapshot
The consequences of eliminating NP solutions
inferred← citeshttps://doi.org/10.1017/s1471068403001753openalex-snapshot
Computing preferred answer sets by meta-interpretation in Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068422000072openalex-snapshot
Answer Set Planning: A Survey
inferred← citeshttps://doi.org/10.1093/jigpal/jzl017openalex-snapshot
Answer Sets and Qualitative Optimization
inferred← citeshttps://doi.org/10.1093/logcom/exm046openalex-snapshot
A General Framework for Expressing Preferences in Causal Reasoning and Planning
inferred← citeshttps://doi.org/10.1177/0278364916688949openalex-snapshot
BWIBots: A platform for bridging the gap between AI and human–robot interaction research
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13498openalex-snapshot
On Computing Conformant Plans Using Classical Planners: A Generate-And-Complete Approach
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13671openalex-snapshot
Planning in Action Language BC while Learning Action Costs for Mobile Robots
inferred← citeshttps://doi.org/10.3233/fi-2010-359openalex-snapshot
An Investigation of Multi-Agent Planning in CLP
inferred← citeshttps://doi.org/10.3233/ia-2011-0016openalex-snapshot
A long tour from theory to practice
inferred← citeshttps://doi.org/10.4018/978-1-59904-941-0.ch009openalex-snapshot
Declarative Planning and Knowledge Representation in an Action Language
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.162openalex-snapshot
Transaction Logic with Defaults and Argumentation Theories
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508132openalex-snapshot
Planning with Preferences using Logic Programming
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.