Determining the consistency of partial tree descriptions

&
Artificial Intelligence 171 (2-3):185-196 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2006.12.004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Partial order bounding: A new approach to evaluation in game tree search.Martin Müller - 2001 - Artificial Intelligence 129 (1-2):279-311.
Arc-consistency and arc-consistency again.Christian Bessière - 1994 - Artificial Intelligence 65 (1):179-190.
Proof by consistency.Deepak Kapur & David R. Musser - 1987 - Artificial Intelligence 31 (2):125-157.
Corrigendum to “Learning constraints through partial queries” [Artificial Intelligence 319 (2023) 103896].Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros & Toby Walsh - 2024 - Artificial Intelligence 328 (C):104075.
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
On the consistency of defeasible databases.Moisés Goldszmidt & Judea Pearl - 1991 - Artificial Intelligence 52 (2):121-149.
A theorem on the consistency of circumscription.Peter L. Mott - 1987 - Artificial Intelligence 31 (1):87-98.
Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
Properties of tree convex constraints.Yuanlin Zhang & Eugene C. Freuder - 2008 - Artificial Intelligence 172 (12-13):1605-1612.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.

Analytics

Added to PP
2020-12-22

Downloads
3 (#1,729,833)

6 months
2 (#1,445,320)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
The constraint language for lambda structures.Markus Egg, Alexander Koller & Joachim Niehren - 2001 - Journal of Logic, Language and Information 10 (4):457-485.

Add more references