Completion for Multiple Path Orderings Based on Precedence and Binary Decision Diagrams

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1527/tjsai.19.472
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,223
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

A Model of Path-Dependence in Decisions Over Multiple Propositions.Christian List - 2004 - American Political Science Review 98 (3):495-513.
A Bdd-Based Simplification And Skolemization Procedure.Jean Goubault - 1995 - Logic Journal of the IGPL 3 (6):827-855.
An Efficient Calculation of Set Expansion Using Zero-Suppressed Binary Decision Diagrams.Masaaki Nishino, Norihito Yasud & Toru Kobayashi - 2012 - Transactions of the Japanese Society for Artificial Intelligence 27 (2):22-27.
Dynamic Choice Mechanisms.Ludwig von Auer - 1999 - Theory and Decision 46 (3):295-312.
Defeasible Inheritance Systems and Reactive Diagrams.Dov Gabbay - 2008 - Logic Journal of the IGPL 17 (1):1-54.


Added to PP index

Total views
4 ( #1,140,222 of 2,285,728 )

Recent downloads (6 months)
2 ( #573,699 of 2,285,728 )

How can I increase my downloads?


My notes

Sign in to use this feature