Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ACL
1994

favoriteEmaildiscussreport

96views Computational Linguistics» more ACL 1994»

On Determining the Consistency of Partial Descriptions of Trees

13 years 5 months ago

On Determining the Consistency of Partial Descriptions of Trees

Download www.aclweb.org

1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in the description, despite disjunctions inherent in the theory of trees. The resulting algorithm allows for descriptions which go beyond sets of atomic formulas to allow certain types of disjunction and negation.

Tom Cornell

Real-time Traffic

ACL 1994 | ACL 2007 | Consistency Problem | Consistency-checking Algorithm | Remote Dominance |

claim paper

Related Content

» Determining the consistency of partial tree descriptions

» On Ordering Descriptions in a Description Logic

» Formal Consistency Verification of Deliberative Agents with Respect to Communication Proto...

» Reasoning with Individuals for the Description Logic SHIQ

» Shape Description and Invariant Recognition Employing Connectionist Approach

» Software Transactional Memory on Relaxed Memory Models

» A Strategy for Dynamic Interpretation a Fragment and an Implementation

» An Application of Neural Networks to Sequence Analysis and Genre Identification

» BPhyOG An interactive server for genomewide inference of bacterial phylogenies based on ov...

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	ACL
Authors	Tom Cornell

Comments (0)