On Testing Satisfiability of Tree Pattern Queries

First Page		Document Content
Date: 2006-07-29 01:28:11 Logic First-order logic Model theory Predicate logic Datalog FO Decomposition method Constraint logic programming Theoretical computer science Mathematical logic Constraint programming		On Testing Satisfiability of Tree Pattern Queries Add to Reading List Source URL: www.vldb.org Download Document from Source Website File Size: 388,95 KB Share Document on Facebook

	Theory and Practice of Logic Programming, Vol. 6, No. 5, pp, Programming Finite-Domain Constraint Propagators in Action Rules DocID: 1tOef - View Document
	Proceedings of CICLOPS 2009 9th International Colloquium on Implementation of Constraint and LOgic Programming Systems DocID: 1t8iI - View Document
	On the Robustness of Qualitative Distance- and Direction-Reasoning* Jung-Hong Hong Department of Surveying Engineering National Cheng-Kung University DocID: 1rqXQ - View Document
	CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel DocID: 1rm3f - View Document
	AAAI Proceedings Template DocID: 1r9Ui - View Document