Showing papers in "Journal of Applied Logic in 2016"
••
TL;DR: The coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases are proved by proving g-coherent imprecise probability assessments on the respective sequences of conditional events.
48 citations
••
TL;DR: The Bayesian Network has demonstrated to provide a good approximation of a control signal based on previous manual and control actions implemented in the same system (based on predefined setpoints), as well as on the environmental conditions.
40 citations
••
TL;DR: This extended proposal is more domain dependent because it uses technical terms and contrast the relevance of these technical terms into the text, so the heuristic is more accurate.
35 citations
••
TL;DR: A novel intelligent system was designed to detect faults on this type of heating equipment and has been successfully empirically tested under a real dataset obtained during measurements of one year.
33 citations
••
TL;DR: A higher-order logic formalization of commonly used RBD configurations, such as series, parallel, parallel-series and series-parallel, and the formal verification of their equivalent mathematical expressions is presented.
29 citations
••
TL;DR: It is described that if the authors wish to naturalize the logic of the abductive processes and its special consequence relation, they should refer to the following main aspects: “optimization of situatedness”, “maximization of changeability” of both input and output, and high “information-sensitiveness”.
26 citations
••
TL;DR: So-called epistemic Kripke structures for intuitionistic (common) knowledge/belief are defined and corresponding deductive systems are introduced that are sound and complete with respect to these semantics.
13 citations
••
TL;DR: This work investigates which divisive meadows admit transformation of fractions into simple fractions, i.e. fractions without proper subterms that are fractions.
12 citations
••
TL;DR: In this paper, the authors present a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquents-based semantics.
11 citations
••
TL;DR: Upfront formal analysis of redundancy requirements is important in budgeting the resource requirements from a cost versus reliability perspective and several case-studies from the automotive domain highlight the efficacy of this proposal.
11 citations
••
[...]
TL;DR: It is shown using an ultraproduct/ultraroot argument that the class of ( α, β ) -representable posets is elementary, but does not have a finite axiomatization in the case where either α or β = ω.
••
TL;DR: This contribution is an extended and more detailed version of [17], and provides background information on the architecture of the Object-Oriented World Model and on the principles of adaptive knowledge modeling, as well as examination results for the proposed methods.
••
TL;DR: This work on selection of nonlinear biomarkers derived from drawings and handwriting is part of a wider cross-study for the diagnosis of essential tremor led by Biodonostia Institute, and includes not only classic linear features, but also non-linear: fractal dimension and entropy.
••
TL;DR: It is argued that conceptual spaces provide the tools to devise an objective probabilistic account of static rationality and a principle that derives prior degrees of belief from the geometrical structure of concepts is proposed.
••
TL;DR: Within the framework of (Unary) Pure Inductive Logic, four possible formulations of a probabilistic principle of analogy based on a template considered by Paul Bartha are investigated and some characterizations of the probability functions which satisfy them are given.
••
TL;DR: It is argued that Lakatos' criticism was mistaken and that, according to Lakatos's own standards, Carnapian inductive logic was progressive rather than degenerate.
••
TL;DR: It is proved that a restricted Hilbert system for daC, named DC, satisfies certain properties that help to show that this logic is not a maximal paraconsistent system.
••
TL;DR: This paper shows how to interpret in a Curry-style system every Pure Type System (PTS) in the Church-style without losing any typing information, and proves a kind of conservative extension result for this interpretation.
••
TL;DR: Under certain conditions a particular way of applying the ‘number of possible states’ argument surprisingly suggests that the weighted arithmetic mean should be used in meta-analysis with unexplained heterogeneity.
••
TL;DR: A combined approach in biometric analysis field, integrating some of the most known techniques using ears to recognize people by the patterns of its ear, showing robustness improving the ear recognition process.
••
TL;DR: A translation technique is presented which transforms a class of First Order Logic formulas, called Restricted formulas, into ground formulas, which allows to remove the equality in the ground formulas and for a large class of formulas their consequences are the same as the initial First Orders.
••
TL;DR: The results illustrate variations in the performance of the respective reasoning systems that derive from the entropy of the environment, and allow for a more inclusive assessment of the reliability and robustness of the four systems.
••
TL;DR: The axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic based on these binary predicates and the connectives are investigated.
••
TL;DR: A representation theorem is proved for such functions on binary languages and it is shown that they satisfy a binary version of the Principle of Instantial Relevance.
••
TL;DR: It is conjecture that, under mild assumptions, all strongly polynomial sequences of graphs can be produced by the general method of quantifier-free interpretation of graphs in certain basic relational structures (essentially disjoint unions of transitive tournaments with added unary relations).
••
TL;DR: This work uses a generalization of the notion of an abstract deductive system to handle multi-sorted deductive systems which differentiate visible and hidden sorts and presents a necessary and sufficient intrinsic condition for two hidden logics to be equivalent.
••
TL;DR: It is argued that the current account of measuring inaccuracy of uncertain doxastic states is inadequate for Belnap's four-valued logic, and a possible inaccuracy measure that is suitable for ordered pairs is described, and it is shown that it has all the qualities that are required for an inacc accuracy measure to be legitimate.
••
TL;DR: A novel approach, which is based on multiple-valued logic (MVL), to the verification and analysis of digital hardware designs, which extends the common ternary or quaternary approaches for simulations.
••
[...]
TL;DR: The paper formulate a generalised and iterable orthodox Bayesian revision dynamics, which allows to define an updating procedure for the generalised Bayesian progic, and compares the generalisation and Williamson's objective Bayian progic in strength, update dynamics and with respect to language (in)sensitivity.
••
TL;DR: This article demonstrates that typical restrictions which are imposed in dialogical logic in order to recover first-order logical consequence from a fragment of natural language argumentation are also forthcoming from preference profiles of boundedly rational players, provided that these players instantiate a specific player type and compute partial strategies.