assign pu the functional category t, if: (1) the co-occurrences of the pair t-pu are explicit and the pair is semantically related bases on the syntactic structures of sentences, or (2) the co-occurrences of the pair t-pu are implicit based on the inference rules of predicate logic. ...
Rules of inference that express methods of contensive reasoning were already partially systematized in the bounds of traditional formal logic in the forms of syllogistic modes and were subsequently absorbed, sometimes with changes, into mathematical logic; examples include the rule ofmodus ponens(syllog...
The logic of single-conclusion ( functional) proofs ( FLP) is introduced. It combines the verification property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that FLP is decidable, so...
The concept of well-behaved inference rules is developed in first-order polynomial-based theorem proving. It is shown that well-behaved inference rules are complete for both the set of support strategy and the linear strategy. Furthermore, two concrete inference rules that are well behaved are pr...
Alternatively, in the absence of an agent A, a machine M seeks an unknown logic underlying given data. We next consider the problem of learning logical inference rules by induction. Given a set S of propositional formulas and their logical consequences T, the goal is to find deductive ...
A business rule is a rule that is 'of, for and by' the business community, refers to business things and is expressed in the language of the business. An important category of business rules, typically called inference rules,[1] involves expressions using 'if…then…', or a variant such...
Logical inferentialists claim that the meanings of the logical constants are given by their inference rules. To rule outtonk-like expressions, it is often demanded that pairs of inference rules must beharmonious. The usual inference rules for the identity predicate are not harmonious, but most ...
Aim of this work is to investigate from a proof-theoretic viewpoint a propositional and a predicate sequent calculus with an ω–type schema of inference t... S Baratella,A Masini - 《Archive for Mathematical Logic》 被引量: 27发表: 2004年 Proof theory /-2nd ed The first edition of this...
Also known as an inference-based rules engine, the Microsoft BRE also supports forward chaining of business rules which causes the BRE to re-evaluate rules in a policy when the action of a rule that has fired causes a change to the state of a fact that has otherwise already been asserted...
Bachmair, L., and Dershowitz, N., “Inference rules for rewrite-based first-order theorem proving,” Proc. IEEE Symp. Logic in Computer Science, Ithaca, New York, 1987. [Boyer 71] Boyer, R.S., Locking: A restriction of resolution. Ph.D. Thesis, University of Texas, Austin, 1971. [...