Filters








426 Hits in 3.5 sec

Page 18 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
A new method for testing entailments T —* g in propositional multivalued logics, where 7,q are propositional formulae and —* is one of the four entailment relations introduced in the paper, is described  ...  {For the entire collection see MR 97k:03003. } Téru Miyama (Osaka) 98a:03032 03B50 03D15 68Q25 Cadoli, Marco (I-ROME-I; Rome); Schaerf, Marco (l-ROME-I; Rome) On the complexity of entailment in propositional  ... 

Minimally inconsistent reasoning in Semantic Web

Xiaowang Zhang, Georgios V. Gkoutos
2017 PLoS ONE  
Finally, the complexity of minimally inconsistent description logic reasoning is shown on the same level as the (classical) description logic reasoning.  ...  To this end, this paper presents a non-monotonic paraconsistent version of description logic reasoning, called minimally inconsistent reasoning, where inconsistencies tolerated in the reasoning are minimized  ...  Acknowledgments The authors thank Kewen Wang and Zuoquan Lin for their helpful and constructive comments. Xiaowang Zhang also thanks Ulrike Sattler for helpful e-mail communications.  ... 
doi:10.1371/journal.pone.0181056 pmid:28750030 pmcid:PMC5531629 fatcat:6ayfpnn4g5avtipmlmkua7lyye

Proposal For The Formalization Of Dialectical Logic

José Luis Usó-Doménech, Josué Antonio Nescolarde-Selva, Lorena Segura-Abad
2016 Zenodo  
Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality.  ...  Three rules are proposed to pass from classic logic to synthetic logic.  ...  Acknowledgments: The authors like to thank Hugh Gash for his important collaboration in this work, especially English corrections and scientific recommendations.  ... 
doi:10.5281/zenodo.1041660 fatcat:zbqzgeu4wrabfljby72dv3bv4i

Multivalued Default Logic for Identity Maintenance in Visual Surveillance [chapter]

Vinay D. Shet, David Harwood, Larry S. Davis
2006 Lecture Notes in Computer Science  
In this paper, we propose a prioritized, multivalued, default logic based framework that allows reasoning about the identities of individuals.  ...  Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent "atomic" events.  ...  Another source of intractability for traditional default logics is the method of choosing a consistent set of propositions entailed by the default theory from the set of all its extensions.  ... 
doi:10.1007/11744085_10 fatcat:pi47z24ujfch5p2tfhi3hej7s4

Acceptable Contradictions: Pragmatics or Semantics? A Reply to Cobreros et al

Sam Alxatib, Peter Pagin, Uli Sauerland
2012 Journal of Philosophical Logic  
(Journal of Philosophical Logic 2011) suggest a pragmatic account of the acceptability of borderline contradictions.  ...  The analysis is close to a variant of fuzzy logic, but conjunction and disjunction are interpreted as intensional operators.  ...  and ∧ of multivalued logic.  ... 
doi:10.1007/s10992-012-9241-7 fatcat:fjebfb6qtzfgdmb46kuuyjw3qu

New directions in the analysis and interactive elicitation of personal construct systems

Brian R. Gaines, Mildred L.G. Shaw
1980 International Journal of Man-Machine Studies  
A grid analysis program called ENTAIL is described based on these techniques which derives a network of entailments from a grid.  ...  recommendations are made about its generalization and extension based on the logical foundations described.  ...  Many people over the years have influenced the direction of this work.  ... 
doi:10.1016/s0020-7373(80)80038-1 fatcat:i6mxuyhqajhs7olou4u7g3n7we

Proposal for the Formalization of Dialectical Logic

José Usó-Doménech, Josué Nescolarde-Selva, Lorena Segura-Abad
2016 Mathematics  
This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number.  ...  In this dialectical logic, contradictions of the neuter of an opposition may be true.  ...  Acknowledgments: The authors like to thank Hugh Gash for his important collaboration in this work, especially English corrections and scientific recommendations.  ... 
doi:10.3390/math4040069 fatcat:7rqw7nmod5bnrbn2cnjvjttyqu

Extended Well-Founded Semantics In Bilattices

Daniel Stamate
2007 Zenodo  
One of the most successful semantics of conventional logic programs based on the CWA is the well-founded semantics.  ...  One of the most used assumptions in logic programming and deductive databases is the so-called Closed World Assumption (CWA), according to which the atoms that cannot be inferred from the programs are  ...  We have also shown that the complexity of the evaluation of the extended well-founded semantics with respect to the size of the set of program facts is polynomial time, if we restrict the multivalued logic  ... 
doi:10.5281/zenodo.1062139 fatcat:3eqokvw5sradrlznvxp6t33oze

Paraconsistent OWL and related logics

Frederick Maier, Yue Ma, Pascal Hitzler
2013 Semantic Web Journal  
However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL.  ...  OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies.  ...  Multivalued Paraconsistent Logics A logic is paraconsistent if the principle of explosion fails in at least one case, that is if there exist statements P and Q, and a set of statements K, such that K |  ... 
doi:10.3233/sw-2012-0066 fatcat:cltdeeoeifhyrdcqc3tftogbzq

Finite non-deterministic semantics for some modal systems

Marcelo E. Coniglio, Luis Fariñas del Cerro, Newton M. Peron
2015 Journal of Applied Non-Classical Logics  
Trying to overcome Dugundji's result on uncharacterizability of modal logics by finite logical matrices, J. Kearns (in 1981) and J.  ...  As a by-product, novel decision procedures for T, S4, S5, D, KDB, KD4 and KD45 are obtained, which open interesting possibilities in the study of the complexity of modal logics and, in particular, of Intuitionistic  ...  Previous versions of this paper were presented in [13] and [12] .  ... 
doi:10.1080/11663081.2015.1011543 fatcat:7ao4fgrvsvfxznshex7ayeoy7e

Tractable reasoning via approximation

Marco Schaerf, Marco Cadoli
1995 Artificial Intelligence  
We also want our logic to be useful to perform approximate reasoning in different contexts. We define a method for the approximation of decision reasoning problems based on multivalued logics.  ...  In our research we considered approximation of several decidable problems with different worstcase complexity, involving both propositional and first-order languages.  ...  Donini, Torsten Schaub, Carolyn Talcott and an anonymous referee for their useful suggestions which helped improving both the presentation and the contents of the paper.  ... 
doi:10.1016/0004-3702(94)00009-p fatcat:xaqk5gs3vjffhgnrh53dru56cq

Oracles That Compute Values

Stephen Fenner, Steven Homer, Mitsunori Ogihara, Alan Selman
1997 SIAM journal on computing (Print)  
This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically  ...  in polynomial time.  ...  This notation is consistent with our intuition that F ⊆ c G should entail that the complexity F is not greater than the complexity of G.  ... 
doi:10.1137/s0097539793247439 fatcat:kleyx7dchzaylj567c6yr7jedy

On using oracles that compute values [chapter]

Stephen Fenner, Steve Homer, Mitsunori Ogiwara, Alan L. Selman
1993 Lecture Notes in Computer Science  
This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically  ...  in polynomial time.  ...  This notation is consistent with our intuition that F c G should entail that the complexity F is not greater than the complexity of G.  ... 
doi:10.1007/3-540-56503-5_40 fatcat:vzhhfwnb2vfnno2cf4svetgiru

Page 3140 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Technically, NML3 belongs to the class of preferential logics. The semantics is model-theoretic with well-motivated underlying intuitions and is multivalued.  ...  There are nine different languages of modal logic which in one way or another reflect existing attribute value formalisms.  ... 

The universe of propositional approximations

Marcelo Finger, Renata Wassermann
2006 Theoretical Computer Science  
Schaerf, The complexity of entailment in propositional multivalued logics, Ann. Math. Artif.  ...  In that framework, a family of logics, parameterised by a set of propositional letters, approximates classical logic as the size of the set increases.  ...  Several approximations of propositional classical logics have been proposed in the literature with distinct properties. Our system is based on Cadoli and Schaerf's approximate entailment [25] .  ... 
doi:10.1016/j.tcs.2006.01.007 fatcat:drxo4d6puvhwnalntsaofvorgu
« Previous Showing results 1 — 15 out of 426 results