To resolve structural ambiguities in syntactic analysis of natural language, which are caused by prepositional phrase attachment, relative clause attachment, and so on, we developed an experimental system called tile Dependency Anal!lzcr. The system uses instances of dependency structures extracted froth a terminology dictionary as a knowledge ba.~e. Structural (attachment) ambiguity is represe...

We study multivalued dependencies, as well as the propositional formulas whose deduction calculus parallels that of multivalued dependencies, and the variant known as degenerated multivalued dependencies. For each of these sorts of expressions, we provide intrinsic characterizations in purely semantic terms. They naturally generalize similar properties of functional dependencies or Horn clauses.

This paper proposes a statist ical method for learning dependency preference of Japanese subordinate clauses, in which scope embedding preference of subordinate clauses is exploited as a useful information source for disambiguating dependencies between subordinate clauses. Es t imated dependencies of subordinate clauses successfully increase the precision of an existing statistical dependency a...

Research on filler-gap dependencies has revealed that there are constraints on possible gap sites, and that real-time sentence processing is sensitive to these constraints. This work has shown that comprehenders have preferences for potential gap sites, and immediately detect when these preferences are not met. However, neither the mechanisms that select preferred gap sites nor the mechanisms u...

Functional Dependency has been extensively studied in database theory. It provides an elegant formalism for specifying key constraints and is the basis for normalization theory used in Relational database design. Given its known axiomatization through logical implications it is expected that the ontology community would be interested in investigating its applicability to conceptual modeling. Th...

Variable independence in quantified boolean formulas (QBFs) informally means that the quantifier structure of the formula can be rearranged so that two variables reverse their outer-inner relationship without changing the value of the QBF. Samer and Szeider introduced the standard dependency scheme and the triangle dependency scheme to safely over-approximate the set of variable pairs for which...

This paperaddresses the problem of SAT solver performance in IC3, one of the major recent breakthroughs in Model Checking algorithms. Unlike other Bounded and Unbounded Model Checking algorithms, IC3 is characterized by numerous SAT solver queries on small sets of problem clauses. Besides algorithmic issues, the above scenario poses serious performance challenges for SAT solver configuration an...

Abs t rac t . In [3] a general fohl ol)eration has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tama.ki and Sato in [26,25] because its application does not depend on the tra.~sformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed ...

1. INTRODUCTION. In recent years, the term 'converb' has increasingly been used to describe constructions with cross-linguistically comparable forms and functions which include nonfinite verbal affixation, dependency on a finite verb, clause linking, and the sequencing of Asian converbs, differing primarily with respect to the potential for what Bickel refers to as 'narrative chaining': Asian c...