Abstract A new methodology/data structure, the clause tree, is developed for automated reasoning based on resolution in first order logic. A clause tree T on a set S of clauses is a 4-tuple , where N is a set of nodes, divided into clause nodes and atom nodes, E is a set of edges, each of which joins a clause node to an atom node, L is a labeling of N ∪ E which assigns to each clause n...

By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.

It is interesting to understand the Attentat Clause about extradition of terrorist acts, among others; (1) formulation criminal acts terrorism in law some countries, and Indonesian law, (2) basic idea ​​the attentive clause Article 5 Law Number 15 Year 2003 on Combating Terrorism Crime, (3) legal implications Of differences arrangement attentate clause, between countries (Article Republic Indon...

The Clause slicing technique is a static slicing technique. The clause slice criterion is the clause, which is the smallest part of the code line, with the clause number. In this paper, we introduce the “Clauser,” which is a new clause slicing tool for C programs. The Clauser is a slicing tool that divides the program code lines into clauses, depending on certain rules, and then it slices the c...

0 Introduction This paper represents the continutation of research into the identiication of the relationship between the head of a relative clause and the clause body, for Japanese. Unlike many languages, a `trace' of the gap associated with the head of a gapping relative clause is not lexically marked in Japanese, and gapping and non-gapping clauses are not explicitly distinguished. Our curre...

Quantified Boolean Formulas (QBFs) can be used to succinctly encode problems from domains such as formal verification, planning, and synthesis. One of the main approaches to QBF solving is Quantified Conflict Driven Clause Learning (QCDCL). By default, QCDCL assigns variables in the order of their appearance in the quantifier prefix so as to account for dependencies among variables. Dependency ...

We present DPVIS, a Java tool to visualize the structure of SAT instances and runs of the DPLL (Davis-Putnam-Logemann-Loveland) procedure. DPVIS uses advanced graph layout algorithms to display the problem’s internal structure arising from its variable dependency (interaction) graph. DPVIS is also able to generate animations showing the dynamic change of a problem’s structure during a typical D...

This paper investigates clausal data-driven dependency parsing. We first motivate a clause as the minimal parsing unit by correlating interand intra-clausal relations with relation type, depth, arc length and non-projectivity. This insight leads to a two-stage formulation of parsing where intra-clausal relations are identified in the 1 stage and inter-clausal relations are identified in the 2 s...

We study a group of adverbials that are composed of a preposition and a noun denoting an emotion or an inner state, such as v jarosti ‘in a rage’, s udovol’stviem ‘with pleasure’, ot radosti ‘out of joy’, s gorja ‘out of grief’, na udivlenie ‘to the surprise of’, k dosade ‘to one’s disappointment’ etc. Being collocations, they occupy an intermediate position between free phrases and idioms. On ...