In Prolog the flow of control is relatively complex; four counts (which we call currents)—call, fail, succeed and redo—and two intrinsic properties—the failure and the ‘alternative’ probabilities— can be associated with every literal in a clause body. In this work we describe a new matrix model where those currents and properties are related at the literal, clause and predicate definition level...

Inductive learning of recursive logical theories from a set of examples is a complex task characterized by three important issues, namely the adoption of a generality order stronger than θ-subsumption, the nonmonotonicity of the consistency property, and the automated discovery of dependencies between target predicates. Solutions implemented in the learning system ATRE are briefly reported in t...

Korean Combinatory Categorial Grammar (KCCG) is an extended combinatory categorial grammar formalism that can capture the syntax and interpretation of the \relative free" word order, long distance scrambling and other characteristics of Korean. The KCCG formalism can uniformly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and across claus...

Currently, grouping in XQuery must be expressed implicitly with nested FLWOR expressions. With XQuery 1.1, an explicit group by clause will be part of this query language. As users integrate this new construct into their applications, it becomes important to have efficient evaluation techniques available to process even complex grouping conditions. Among them, the removal of distinct values or ...

this article is concerned with the question of how much the assured will be entitled to recover following an assured loss. it will be discussed which three elements are involved in this respect; first the loss of assured, second the amount of assuror obligation and third the contractual agreements of the parties in respect of the amount of assuror's payment.it should be noted that franchis...

The paper concentrates on deriving non-obvious information about clause structure of complex sentences from the Prague Dependency Treebank. Individual clauses and their mutual relationship are not explicitly annotated in the treebank, therefore it was necessary to develop an automatic method transforming the original annotation concentrating on the syntactic role of individual word forms into a...

Recently, there has been a rise of interest in unsupervised detection of highlevel semantic relations involving complex units, such as phrases and whole sentences. Typically such approaches are faced with two main obstacles: data sparseness and correctly generalizing from the examples. In this work, we describe the Clustered Clause representation, which utilizes information-based clustering and...

literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one positive literal. definite clause: A definite clause is a Hom Clause in which there is exactly one positive literal. A definite clause such as can also be written as We call pi the head of the clause, and the conjunction...