Caferra, R., Zabel, N.: An application of many-valued logic to decide propositional S5 formulae: A strategy designed for a parametric tableaux-based theorem prover. In: Artificial Intelligence IV: Methodology, Systems, Applications, pp. 23-32. Elsevier, Amsterdam, The Netherlands (1990)...
ProteinFunctionPrediction:ApplicationofaPropositionalRulesLearning SystemtoasetofHumanProteinSequences ManuelJ.Gómez(1),FranciscoJavierGuijarro(1),RamónP.Otero(2),LarsJ.Jensen(3), SørenBrunak(3),andAlfonsoValencia(1) (1)CentroNacionaldeBiotecnología,CSIC,Madrid,Spain. ...
We focus on its semantical theory from the viewpoint of Pavelka's graded semantics of propositional fuzzy logic, investigate the L-tautologies based on different Kripke frames. We also define the notion of L-semantical consequence operation, its some basic properties are obtained. Finally, this ...
Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics 11(1-2), 11–34 (2001) MathSciNet MATHOn the tractable counting of theory models and its application to truth maintenance and ...
On an interpretation of second-order quantification in first-order intuitionistic propositional logic J. Symbolic Logic, 57 (1) (1992), pp. 33-52 CrossrefGoogle Scholar [23] A. Visser Uniform interpolation and layered bisimulation P. Hájek (Ed.), Gödel'96, Lecture Notes in Logic, vol. ...
Its primary application is the investigation of axiomatiza- tions of propositional logics at a first-order meta-level. CD also provides a tech- nical approach to the Curry-Howard correspondence, "formulas as types" [22,23] and is considered in witness theory [57]. Many early successes in ...
Abstract We compare two notions to measure the expressive power of various dynamic logics: Reducibility and AP-reducibility. With those and the techniques from model theory for infinitary and other generalized logics we solve some open problems in definability theory of dynamic logic....
However,propositional logic alone has a limited range of application to practice problems,and so here we examine the description of practice problems using predicatelogic by extending propositional logic to f i rst-order predicate logic, and considerthe effectiveness of this approach.Keywords: Problem-...
Let ∑ be a propositional signature, that is, a set of propositional atoms. We call w a world (in ∑) iff w ⊆ ∑ ∪ ¬ ∑, and for every p∈ ∑ either p∈ w or ¬p∈ w. w ⊨ φ denotes validity of the formula φ in w. Let W be the set of...
Example 2 For ◦ ∈ {∧, ∨}, let PL¬,◦ be the language of propositional logic over the set S (whose members we construe, for the purposes of this example, as sentence letters) with the syntax φ::= p | ¬φ | (φ ◦ φ). Let δ : PL¬,∧→ PL¬,∨ rewrite...