A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs.

Previous research suggests that time-based working memory limits of 2e3 s constrain the integration of verbal information, and that speakers tend to parse sentences into prosodic phrases that do not extend beyond this time window. The present study used Event-Related Potentials (ERPs) to investigate how time-driven implicit prosodic phrasing influences the syntactic processing of embedded claus...

Finding all satisfying assignments of a propositional formula has many applications to the synthesis and verification of hardware and software. An approach to this problem that has recently emerged augments a clause-recording propositional satisfiability solver with the ability to add “blocking clauses.” One generates a blocking clause from a satisfying assignment by taking its complement. The ...

Relative clause attachment may be triggered by binding requirements imposed by a short anaphor contained within the relative clause itself: in case more than one possible attachment site is available in the previous structure, and the relative clause itself is extraposed, a conflict may arise as to the appropriate s/c-structure which is licenced by grammatical constraints but fails when the bin...

In this paper, we propose a method for automatic clause boundary annotation in the Hindi Dependency Treebank. We show that the clausal information implicitly encoded in a dependency structure can be made explicit with no or less human intervention. We exercised the proposed approach on 16,000 sentences of Hindi Dependency Treebank. Our approach gives an accuracy of 94.44% for clause boundary id...

We devise a resolution calculus that tests the satisfiability of infinite families of clause sets, called clause set schemata. For schemata of propositional clause sets, we prove that this calculus is sound, refutationally complete, and terminating. The calculus is extended to first-order clauses, for which termination is lost, since the satisfiability problem is not semi-decidable for nonpropo...

2. Fronting pattern follows from three ranked, violable constraints: Antecedent: An anaphor has an accessible antecedent, i.e. an anaphor has an antecedent and the anaphor does not precede and c-command its antecedent (Hankamer and Sag, 1976). >> TopFirst: Topic is clause initial, i.e. if a syntactic constituent is topic it is clause initial (= in Spec-CP; cf. Costa 2001:176). >> SubjFirst: Sub...

In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However, most DLS algorithms require the tuning of domain dependent parameters before their performance becomes competitive. If manual parameter tuning is impractical then various mechanisms have been developed that can auto...

The simplest non{trivial program pattern in logic programming is the following one : 8 < : p(fact) : p(left) p(right) : p(goal) : where fact, goal, left and right are arbitrary terms. Because the well known append program matches this pattern, we will denote such programs \append{like". In spite of their simple appearance, we prove in this paper that termination and satissability (i.e the exist...

We demonstrate that it is fairly easy to decompose any propositional formula into two subsets such that both can be solved by blocked clause elimination. Such a blocked clause decomposition is useful to cheaply detect backbone variables and equivalent literals. Blocked clause decompositions are especially useful when they are unbalanced, i.e., one subset is much larger in size than the other on...