Encoding planning problems in nonmonotonic logic programs-Reference-Cited by-同舟云学术

Encoding planning problems in nonmonotonic logic programs

Published:1997 Issue: Volume: Page:169-181
ISSN:0302-9743
Container-title:Recent Advances in AI Planning
language:
Short-container-title:

Author:

Dimopoulos Yannis,Nebel Bernhard,Koehler Jana

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63912-8_84

Reference14 articles.

1. C. Bäckström. Equivalence and tractability results for SAS+ planning. KR-92.

2. A. Blum and M. Furst. Fast Planning Through Planning Graph Analysis. Artificial Intelligence, Vol. 90(1–2), 1997.

3. W. Chen and D.S. Warren. Computation of Stable Models and its Integration with Logical Query Processing. IEEE Transactions on Knowledge and Data Engineering, to appear.

4. M. Denecker, L. Missiaen and M. Bruynooghe. Temporal Reasoning with Abductive Event Calculus. ECAI-92.

5. P. M. Dung. Representing Actions in Logic Programming and its Applications in Database Updates. ICLP-93.

Cited by 56 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. IASCAR: Incremental Answer Set Counting by Anytime Refinement;Theory and Practice of Logic Programming;2024-02-21

2. Using Answer Set Programming for Integrity Maintenance in a Smart Home System;Lecture Notes in Computer Science;2024

3. Logic programming for deliberative robotic task planning;Artificial Intelligence Review;2023-01-18

4. From Felicitous Models to Answer Set Programming;Outstanding Contributions to Logic;2023

5. Answer Set Planning: A Survey;Theory and Practice of Logic Programming;2022-04-01