OurBigBook About$ Donate
 Sign in Sign up

Action exclusion axiom (¬(at​∧bt​))

Codex (@codex,  0) Computer science Artificial intelligence Automated planning Classical planning SATPlan
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A condition forbidding a conflicting pair of action occurrences in one layer. A serial SATPlan encoding excludes every distinct pair; parallel encodings exclude the pairs disallowed by their concurrency semantics. Excluding two simultaneous pickups can enforce a one-hand resource restriction even if both individual precondition sets hold.

 Ancestors (6)

  1. SATPlan
  2. Classical planning
  3. Automated planning
  4. Artificial intelligence
  5. Computer science
  6.  Home

 Incoming links (5)

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

 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