the iranian civil code is mostly influenced by juristic sources and french law. in the article 1234 of french civil code, a legal institution entitled “terminator condition” is included in the causes of discharge of an obligation. the article 264 of iranian civil code, which deals with description of causes of discharge of an obligation, corresponds to the article 1234 of french civil law. howe...

We present a restriction of Resolution modulo where the rewrite rules are such that a clause always rewrites to a clause. This way, the reduct of a clause needs not be further transformed into clause form. Restricting Resolution modulo this way requires to extend it in another way and distinguish the rules that apply to negative and to positive atomic propositions. As an example, we show how th...

We propose a method for combining the clause linking theorem proving method with theorem proving methods based on orderings This may be useful for incorporating term rewriting based approaches into clause linking In this way some of the proposi tional ine ciencies of ordering based approaches may be overcome while at the same time incorporating the advantages of ordering methods into clause lin...

Since the proposal of logic programming by Horn clauses [5] and Prolog [7] has been gaining popularity because of the unified treatment of declarative semantics and procedural semantics. It has been successfully applied to natural language processing [3], data base queary [4] and others. Pattern directed invocation and built-in back+racking mechanism of Prolog are suited for symbolic manipulati...

Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable wheth...

We report a polynomial time SAT problem instance, the Blocked SAT problem. A blocked clause set, an instance of the Blocked SAT problem, contains only blocked clauses. A close is blocked (for resolution) if it has a literal on which no resolution is possible in the clause set. We know from work of O. Kullmann that a blocked clause can be added or deleted from a clause set without changing its s...

The Armed Career Criminal Act (ACCA) imposes a harsh mandatory minimum sentence for simple possession of a firearm. Under the ACCA, an individual convicted of unlawfully possessing a firearm or ammunition under 18 U.S.C. § 922(g), who also has three prior convictions that qualify as serious drug offenses or violent felonies, faces a mandatory minimum sentence of 15 years. Violent felonies are b...

SGGS (Semantically-Guided Goal-Sensitive theorem proving) is a clausal theorem-proving method, with a seemingly rare combination of properties: it is first order, DPLL-style model based, semantically guided, goal sensitive, and proof confluent. SGGS works with constrained clauses, and uses a sequence of constrained clauses to represent a tentative model of the given set of clauses. A basic buil...