This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...

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 ...

Even though, a lot of research has already been done on Machine Translation, translating complex sentences has been a stumbling block in the process. To improve the performance of machine translation on complex sentences, simplifying the sentences becomes imperative. In this paper, we present a rule based approach to address this problem by simplifying complex sentences in Hindi into multiple s...

This article examined whether semantic indeterminacy plays a role in comprehension of complex structures such as object relative clauses. Study 1 used a gated sentence completion task to assess which alternative interpretations are dominant as the relative clause unfolds; Study 2 compared reading times in object relative clauses containing different animacy configurations to unambiguous passive...

A crucial way for reducing the search space in automated deduction are the so-called selection strategies: in each clause, the subset of selected literals are the only ones involved in inferences. For rst-order Horn clauses without equality, resolution is complete with an arbitrary selection of one single literal in each clause dN96]. For Horn clauses with built-in equality, i.e., paramodulatio...

The presence of complement clause constructions in child speech marks the beginning of the child’s entrance into the more complex aspects of grammar. Since complement clauses are lexically-specified, individual complement taking verbs (CTVs) must be tagged with information about the kinds of complements they can license; their acquisition suggests that children are beginning to elaborate the ar...

In this paper we present a parallel prover for the propositional satisfiability problem called PICHAFF. The algorithm is an adaption of the state-of-the-art solver CHAFF optimised for our scalable, dynamically reconfigurable multiprocessor system based on Microchip PIC microcontroller. Like usually in modern SAT solvers it includes lazy clause evaluation, conflict-driven learning, non-chronolog...

Speech disfluencies have been studied as clues to human speech production mechanisms. Major constituents are assumed to be principal units of planning and disfluencies are claimed to occur when speakers have some trouble in planning such units. We tested two hypotheses about the probability of disfluencies by examining the ratios of filled pauses (fillers) at sentence and clause boundaries: 1) ...