Answer set programming and plan generation

DOI10.1016/S0004-3702(02)00186-8zbMATH Open0995.68020DBLPjournals/ai/Lifschitz02WikidataQ56562303 ScholiaQ56562303MaRDI QIDQ1603732

Vladimir Lifschitz

Publication date: 15 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

planningframe problemlogic programmingdefault logicanswer sets

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extending and implementing the stable model semantics
• STRIPS: A new approach to the application of theorem proving to problem solving
• Logic programs with stable model semantics as a constraint programming paradigm
• Representing action and change by logic programs
• Representing actions in logic programs and default theories a situation calculus approach
• A logic for default reasoning
• Nonmonotonic logic and temporal projection
• The anomalous extension problem in default reasoning

Cited In (74)

• Generating explanations for biomedical queries
• Logic Programming for Multiagent Planning with Negotiation
• Answer Set Programming for Single-Player Games in General Game Playing
• Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
• “Add Another Blue Stack of the Same Height!”: ASP Based Planning and Plan Failure Analysis
• Algorithmic Decision Theory Meets Logic
• Diagnostic Reasoning for Robotics Using Action Languages
• Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic
• Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy
• Shift Design with Answer Set Programming
• First-order modular logic programs and their conservative extensions
• The Design of the Sixth Answer Set Programming Competition
• Gearing Up for Effective ASP Planning
• A deductive solution for plan generation
• Answer Set Programming: A Primer
• Brave Induction
• plasp 3: Towards Effective ASP Planning
• Inductive Negotiation in Answer Set Programming
• Answer sets and qualitative decision making
• Querying incomplete information in RDF with SPARQL
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Planning with Incomplete Information in Quantified Answer Set Programming
• Beyond NP: Quantifying over Answer Sets
• Thirty years of Epistemic Specifications
• Introduction: Progress in formal commonsense reasoning
• Planning as tabled logic programming
• The Seventh Answer Set Programming Competition: Design and Results
• Title not available (Why is that?)
• Formalising the Fisherman's Folly puzzle
• CASP solutions for planning in hybrid domains
• Anytime Computation of Cautious Consequences in Answer Set Programming
• The Independent Choice Logic and Beyond
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Brave induction: a logical framework for learning from incomplete information
• Conflict-driven answer set solving: from theory to practice
• Fixed point semantics for stream reasoning
• Representing and reasoning about game strategies
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• Fuzzy answer sets approximations
• Design and results of the Fifth Answer Set Programming Competition
• Justifications for logic programs under answer set semantics
• Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
• Approximation of action theories and its application to conformant planning
• Inferring phylogenetic trees using answer set programming
• A rule based knowledge transaction model for mobile environments
• Nonmonotonic causal theories
• FLP answer set semantics without circular justifications for general logic programs
• Probabilistic Rule Learning in Nonmonotonic Domains
• Determining inference semantics for disjunctive logic programs
• Logic programming and knowledge representation---The A-Prolog perspective
• Open answer set programming for the semantic web
• Solving problems in the polynomial hierarchy with ASP(Q)
• Semantic forgetting in answer set programming
• What is answer set programming to propositional satisfiability
• Argumentation frameworks as constraint satisfaction problems
• Extended RDF: computability and complexity issues
• Learning discrete decomposable graphical models via constraint optimization
• Repairing inconsistent answer set programs using rules of thumb: a gene regulatory networks case study
• Logic Programming
• Heuristic planning: A declarative approach based on strategies for action selection
• Conflict-driven ASP solving with external sources
• Complexity results for answer set programming with bounded predicate arities and implications
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
• Logic programming
• Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
• Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
• Answer set programming made easy
• Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming
• Expressiveness of communication in answer set programming
• Domain-Independent Cost-Optimal Planning in ASP
• Title not available (Why is that?)
• Argumentation-Based Semantics for Logic Programs with First-Order Formulae
• Qualitative reasoning about 2D cardinal directions using answer set programming
• Contrastive explanations for answer-set programs

This page was built for publication: Answer set programming and plan generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603732)