Model counting is an important problem in artificial intelligence and is applied in several areas of information science. Extension rule is a method which could be used to count models. But it’s not appropriate when clause length is short or clause number is huge. After studying extension rule, we found that the satisfiability problem could be solved by hitting set algorithms. And the models co...

While clause resolution is central to logic programming, practical eeorts to optimize resolution have largely concerned eecient clause indexing. One recent exception is Uniication Factoring 5], which optimizes backtracking through clause heads. Here we consider the problem of optimizing clause resolution in a more general setting than Uniication Factoring. One fundamental change is to use mode ...

While clause resolution is central to logic programming, practical eeorts to optimize resolution have largely concerned eecient clause indexing. One recent exception is Uniication Factoring 5], which optimizes backtracking through clause heads. Here we consider the problem of optimizing clause resolution in a more general setting than Uniication Factoring. One fundamental change is to use mode ...

Halliday’s Systemic Functional Linguistics (SFL) has stood the test of time as a model of text analysis. The present literature contains a plethora of studies that while taking the ‘clause’ as a unit of analysis have put into investigation the metafunctions in research articles of a single field of study or those of various fields in comparison. Although ‘clause complex’ is another unit of SF a...

a jurisprudential and legal survey on reflection of fairness in the special legal acts siroos shahriyari [1] hamid miri (ph.d.) [2]     abstract with a view to foreign and domestic law and jurisprudence, it is appeared that there are streaks of making attention to the fairness factor behind of confronting some special legal acts such as usury and mortgage contracts, penal and non-liability clau...

The appeal of constraint programming (CP) lies in compositionality – the ability to mix and match constraints as needed. However, this flexibility typically does not extend to the types of variables. Solvers usually support only a small set of pre-defined variable types, and extending this is not typically a simple exercise: not only must the solver engine be updated, but then the library of su...

The puzzle addressed here is the appearance of the POSS sign, pictured at right above, in both attributive (1a) and predicative (2b) possessive constructions.2 Patterns in the morphosyntax and semantics of POSS possessives reveal that the underlying function of POSS across these constructions is that of a verbal predicate. The analysis of POSS as a verbal predicate is transparently supported by...

In this paper we present a bottom-up algorithm called MRI to induce logic programs from their examples. This method can induce programs with a base clause and more than one recursive clause from a very small number of examples. MRI is based on the analysis of saturations of examples. It rst generates a path structure, which is an expression of a stream of values processed by predicates. The con...

Building on the framework of Maggi and Rodr̀ıguez-Clare (1998), this paper will explore whether a small country facing domestic political pressures values joining a trade agreement with flexibility in the form of an escape clause (a feature included in many trade agreements, including the WTO). More specifically, this paper will examine if a government would prefer to join a trade agreement with...