OurBigBook About$ Donate
 Sign in Sign up

Planning as satisfiability by Henry Kautz and Bart Selman (1992)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-24  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Bart Selman, Work by Henry Kautz
Author-hosted paper: www.cs.cornell.edu/selman/papers/pdf/92.ecai.satplan.pdf
Author bibliography: www.cs.cornell.edu/selman/papers/
Published in Proceedings of ECAI 1992, pp. 359–363. The paper introduced the SATPlan approach. The bounded model, state-transition formulas and deletion-sensitive proof used here are given explicitly rather than relying on a copied encoding.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (2)

  • Past exam of the computer science course of the University of Oxford / 2021 / Artificial intelligence / 3 / e / Solution
  • SATPlan

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook