On the public citation graph

Default reasoning by deductive planning

https://doi.org/10.1007/bf00881829
0 signed · 67 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/3-540-16780-3_113openalex-snapshot
NP-completeness of the set unification and matching problems
inferredcites →https://doi.org/10.1007/3-540-52885-7_112openalex-snapshot
A tableaux-based theorem prover for a decidable subset of default logic
inferredcites →https://doi.org/10.1007/3-540-53104-1_36openalex-snapshot
Planning in polynomial time
inferredcites →https://doi.org/10.1007/3-540-53487-3_35openalex-snapshot
Generating plans in linear logic
inferredcites →https://doi.org/10.1007/3-540-54659-6_107openalex-snapshot
A tableau-based characterisation for default logic
inferredcites →https://doi.org/10.1007/3-540-58216-9_37openalex-snapshot
Towards efficient calculi for resource-oriented deductive planning
inferredcites →https://doi.org/10.1007/3-540-58467-6_2openalex-snapshot
Representing concurrent actions and solving conflicts
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-76274-1_3openalex-snapshot
On Open Defaults
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-83397-7_21openalex-snapshot
A Deductive Solution for Plan Generation
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-662-02906-0openalex-snapshot
Nonmonotonic Logic
inferredcites →https://doi.org/10.1007/bf00244285openalex-snapshot
SLDNF-resolution with equality
inferredcites →https://doi.org/10.1007/bf00244496openalex-snapshot
On the completeness of SLDENF-resolution
inferredcites →https://doi.org/10.1007/bf00297251openalex-snapshot
Opening the AC-unification race
inferredcites →https://doi.org/10.1007/bf00881832openalex-snapshot
A new methodology for query answering in default logics via structure-oriented theorem proving
inferredcites →https://doi.org/10.1007/bf01530895openalex-snapshot
Computing change and specificity with equational logic programs
inferredcites →https://doi.org/10.1007/bf03037149openalex-snapshot
Compiling a default reasoning system into Prolog
inferredcites →https://doi.org/10.1007/bf03037383openalex-snapshot
A Logic-based Calculus of Events
inferredcites →https://doi.org/10.1007/bf03037518openalex-snapshot
A new deductive approach to planning
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0021964openalex-snapshot
The computational value of joint consistency
inferredcites →https://doi.org/10.1007/bfb0028215openalex-snapshot
Variations of constrained default logic
inferredcites →https://doi.org/10.1007/bfb0030398openalex-snapshot
Normal form results for default logic
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/0004-3702(76)90008-4openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(86)90003-2openalex-snapshot
Controlling recursive inference
inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot
Applications of circumscription to formalizing common-sense knowledge
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(88)90077-xopenalex-snapshot
A logical framework for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(91)90011-8openalex-snapshot
Hard problems for simple default logics
inferredcites →https://doi.org/10.1016/0004-3702(91)90099-6openalex-snapshot
Cumulative default logic
inferredcites →https://doi.org/10.1016/0004-3702(93)90004-uopenalex-snapshot
On prediction in theorist
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/0004-3702(94)90106-6openalex-snapshot
Alternative approaches to default logic
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0743-1066(84)90010-4openalex-snapshot
A theory of complete logic programs with equality
inferredcites →https://doi.org/10.1016/0743-1066(89)90028-9openalex-snapshot
Extending SLD resolution to equational horn clauses using E-unification
inferredcites →https://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferredcites →https://doi.org/10.1016/b978-0-12-450010-5.50026-8openalex-snapshot
The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50019-2openalex-snapshot
APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This…
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50033-7openalex-snapshot
Some Philosophical Problems from the Standpoint of Artificial Intelligence
inferredcites →https://doi.org/10.1016/b978-0-934613-30-9.50004-4openalex-snapshot
ON THE SEMANTICS OF STRIPS
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50018-2openalex-snapshot
A FRAMEWORK FOR REPRESENTING KNOWLEDGE
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1093/logcom/2.3.397openalex-snapshot
Complexity Results for Nonmonotonic Logics
inferredcites →https://doi.org/10.1111/j.1467-8640.1988.tb00086.xopenalex-snapshot
Considerations on default logic: an alternative approach1
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00319.xopenalex-snapshot
Explanation and prediction: an architecture for default and abductive reasoning
inferredcites →https://doi.org/10.1111/j.1467-8640.1991.tb00393.xopenalex-snapshot
Planning in polynomial time: the SAS‐PUBS class
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.21236/ad0785031openalex-snapshot
Situations, Actions, and Causal Laws
inferredcites →https://doi.org/10.21236/ada459656openalex-snapshot
Application of Theorem Proving to Problem Solving
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0028openalex-snapshot
Representing Actions in Equational Logic Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119170174.epcn311openalex-snapshot
Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-48747-6_14openalex-snapshot
Learning Default Theories
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_34openalex-snapshot
What is a skeptical proof?
inferred← citeshttps://doi.org/10.1007/3-540-61313-7_101openalex-snapshot
Skeptical query-answering in Constrained Default Logic
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_93openalex-snapshot
XRay: A prolog technology theorem prover for default reasoning: A system description
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_4openalex-snapshot
The Family of Default Logics
inferred← citeshttps://doi.org/10.1007/bf00881832openalex-snapshot
A new methodology for query answering in default logics via structure-oriented theorem proving
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot
Prolog technology for default reasoning: proof theory and compilation techniques
inferred← citeshttps://doi.org/10.1145/3725849openalex-snapshot
Hypersequent Calculi for Propositional Default Logics
inferred← citeshttps://doi.org/10.3233/inf-1997-8101openalex-snapshot
Plan generation with the linear connection method
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.