for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> ENGINEERING (Total: 2160 journals)
    - CHEMICAL ENGINEERING (186 journals)
    - CIVIL ENGINEERING (168 journals)
    - ELECTRICAL ENGINEERING (93 journals)
    - ENGINEERING (1165 journals)
    - ENGINEERING MECHANICS AND MATERIALS (355 journals)
    - HYDRAULIC ENGINEERING (55 journals)
    - INDUSTRIAL ENGINEERING (57 journals)
    - MECHANICAL ENGINEERING (81 journals)

ENGINEERING (1165 journals)            First | 2 3 4 5 6 7 8 9 | Last

International Journal of Heavy Vehicle Systems     Hybrid Journal   (Followers: 7)
International Journal of Hypersonics     Full-text available via subscription   (Followers: 3)
International Journal of Imaging Systems and Technology     Hybrid Journal   (Followers: 2)
International Journal of Impact Engineering     Hybrid Journal   (Followers: 8)
International Journal of Information Acquisition     Hybrid Journal   (Followers: 1)
International Journal of Innovation and Applied Studies     Open Access   (Followers: 3)
International Journal of Innovation Science     Full-text available via subscription   (Followers: 6)
International Journal of Innovative Technology and Research     Open Access  
International Journal of Integrated Engineering     Open Access  
International Journal of Intelligent Engineering Informatics     Hybrid Journal  
International Journal of Intelligent Systems and Applications in Engineering     Open Access  
International Journal of Lifecycle Performance Engineering     Hybrid Journal   (Followers: 1)
International Journal of Machine Tools and Manufacture     Hybrid Journal   (Followers: 5)
International Journal of Manufacturing Research     Hybrid Journal   (Followers: 5)
International Journal of Manufacturing Technology and Management     Hybrid Journal   (Followers: 7)
International Journal of Materials and Product Technology     Hybrid Journal   (Followers: 4)
International Journal of Mathematical Education in Science and Technology     Hybrid Journal   (Followers: 8)
International Journal of Mathematics in Operational Research     Hybrid Journal   (Followers: 1)
International Journal of Medical Engineering and Informatics     Hybrid Journal   (Followers: 5)
International Journal of Micro Air Vehicles     Full-text available via subscription   (Followers: 3)
International Journal of Microwave and Wireless Technologies     Hybrid Journal   (Followers: 1)
International Journal of Microwave Science and Technology     Open Access   (Followers: 2)
International Journal of Mobile Network Design and Innovation     Hybrid Journal   (Followers: 3)
International Journal of Multiphase Flow     Hybrid Journal   (Followers: 2)
International Journal of Nanomanufacturing     Hybrid Journal  
International Journal of Nanoscience     Hybrid Journal  
International Journal of Nanotechnology     Hybrid Journal   (Followers: 4)
International Journal of Nanotechnology and Molecular Computation     Full-text available via subscription   (Followers: 3)
International Journal of Navigation and Observation     Open Access   (Followers: 11)
International Journal of Network Management     Hybrid Journal  
International Journal of Nonlinear Sciences and Numerical Simulation     Hybrid Journal  
International Journal of Numerical Methods for Heat & Fluid Flow     Hybrid Journal   (Followers: 7)
International Journal of Optics     Open Access   (Followers: 1)
International Journal of Organisational Design and Engineering     Hybrid Journal   (Followers: 10)
International Journal of Pattern Recognition and Artificial Intelligence     Hybrid Journal   (Followers: 6)
International Journal of Pavement Engineering     Hybrid Journal   (Followers: 3)
International Journal of Physical Modelling in Geotechnics     Hybrid Journal   (Followers: 3)
International Journal of Plasticity     Hybrid Journal   (Followers: 6)
International Journal of Plastics Technology     Hybrid Journal   (Followers: 1)
International Journal of Polymer Analysis and Characterization     Hybrid Journal   (Followers: 5)
International Journal of Polymer Science     Open Access   (Followers: 20)
International Journal of Precision Engineering and Manufacturing     Hybrid Journal   (Followers: 5)
International Journal of Precision Engineering and Manufacturing-Green Technology     Hybrid Journal  
International Journal of Precision Technology     Hybrid Journal  
International Journal of Pressure Vessels and Piping     Hybrid Journal   (Followers: 3)
International Journal of Production Economics     Hybrid Journal   (Followers: 13)
International Journal of Quality and Innovation     Hybrid Journal   (Followers: 4)
International Journal of Quality Assurance in Engineering and Technology Education     Full-text available via subscription   (Followers: 2)
International Journal of Quality Engineering and Technology     Hybrid Journal   (Followers: 2)
International Journal of Quantum Information     Hybrid Journal  
International Journal of Rapid Manufacturing     Hybrid Journal   (Followers: 3)
International Journal of Reliability, Quality and Safety Engineering     Hybrid Journal   (Followers: 7)
International Journal of Renewable Energy Technology     Hybrid Journal   (Followers: 9)
International Journal of Robust and Nonlinear Control     Hybrid Journal   (Followers: 3)
International Journal of Science Engineering and Advance Technology     Open Access  
International Journal of Sediment Research     Full-text available via subscription   (Followers: 1)
International Journal of Self-Propagating High-Temperature Synthesis     Hybrid Journal   (Followers: 2)
International Journal of Signal and Imaging Systems Engineering     Hybrid Journal  
International Journal of Six Sigma and Competitive Advantage     Hybrid Journal  
International Journal of Social Robotics     Hybrid Journal   (Followers: 2)
International Journal of Software Engineering and Knowledge Engineering     Hybrid Journal   (Followers: 2)
International Journal of Space Science and Engineering     Hybrid Journal   (Followers: 2)
International Journal of Speech Technology     Hybrid Journal   (Followers: 4)
International Journal of Spray and Combustion Dynamics     Full-text available via subscription   (Followers: 6)
International Journal of Superconductivity     Open Access  
International Journal of Surface Engineering and Interdisciplinary Materials Science     Full-text available via subscription   (Followers: 1)
International Journal of Surface Science and Engineering     Hybrid Journal   (Followers: 8)
International Journal of Sustainable Engineering     Hybrid Journal   (Followers: 7)
International Journal of Sustainable Manufacturing     Hybrid Journal   (Followers: 4)
International Journal of Systems and Service-Oriented Engineering     Full-text available via subscription  
International Journal of Systems Assurance Engineering and Management     Hybrid Journal  
International Journal of Systems, Control and Communications     Hybrid Journal   (Followers: 2)
International Journal of Technoethics     Full-text available via subscription   (Followers: 1)
International Journal of Technology Management and Sustainable Development     Hybrid Journal   (Followers: 1)
International Journal of Technology Policy and Law     Hybrid Journal   (Followers: 6)
International Journal of Telemedicine and Applications     Open Access   (Followers: 2)
International Journal of Thermal Sciences     Hybrid Journal   (Followers: 7)
International Journal of Thermodynamics     Open Access   (Followers: 2)
International Journal of Turbo & Jet-Engines     Hybrid Journal  
International Journal of Ultra Wideband Communications and Systems     Hybrid Journal  
International Journal of Vehicle Autonomous Systems     Hybrid Journal   (Followers: 1)
International Journal of Vehicle Design     Hybrid Journal   (Followers: 8)
International Journal of Vehicle Information and Communication Systems     Hybrid Journal   (Followers: 2)
International Journal of Vehicle Noise and Vibration     Hybrid Journal   (Followers: 3)
International Journal of Vehicle Safety     Hybrid Journal   (Followers: 5)
International Journal of Vehicular Technology     Open Access   (Followers: 3)
International Journal of Virtual Technology and Multimedia     Hybrid Journal   (Followers: 4)
International Journal of Wavelets, Multiresolution and Information Processing     Hybrid Journal  
International Journal on Artificial Intelligence Tools     Hybrid Journal   (Followers: 4)
International Nano Letters     Open Access   (Followers: 8)
International Review of Applied Sciences and Engineering     Full-text available via subscription  
International Scholarly Research Notices     Open Access   (Followers: 222)
Inverse Problems in Science and Engineering     Hybrid Journal   (Followers: 2)
Ionics     Hybrid Journal  
IPTEK The Journal for Technology and Science     Open Access  
IRBM News     Full-text available via subscription  
Ironmaking & Steelmaking     Hybrid Journal   (Followers: 2)
Irrigation and Drainage Systems     Hybrid Journal   (Followers: 1)
ISA Transactions     Full-text available via subscription   (Followers: 1)
IT Professional     Full-text available via subscription   (Followers: 3)

  First | 2 3 4 5 6 7 8 9 | Last

Journal Cover   Journal of Applied Logic
  [SJR: 0.936]   [H-I: 19]   Follow
    
   Full-text available via subscription Subscription journal
   ISSN (Print) 1570-8683
   Published by Elsevier Homepage  [2812 journals]
  • An examination of the SEP candidate analogical inference rule within pure
           inductive logic
    • Abstract: Publication date: Available online 16 June 2015
      Source:Journal of Applied Logic
      Author(s): E. Howarth , J.B. Paris , A. Vencovská
      Within the framework of (Unary) Pure Inductive Logic we investigate four possible formulations of a probabilistic principle of analogy based on a template considered by Paul Bartha in the Stanford Encyclopedia of Philosophy [1] and give some characterizations of the probability functions which satisfy them. In addition we investigate an alternative interpretation of analogical support, also considered by Bartha, based not on the enhancement of probability but on the creation of possibility.


      PubDate: 2015-06-20T05:43:26Z
       
  • Relativized common knowledge for dynamic epistemic logic
    • Abstract: Publication date: Available online 16 June 2015
      Source:Journal of Applied Logic
      Author(s): Yì N. Wáng , Thomas Ågotnes
      Relativized common knowledge is a generalization of common knowledge proposed for public announcement logic by treating knowledge update as relativization. Among other things relativized common knowledge, unlike standard common knowledge, allows reduction axioms for the public announcement operators. Public announcement logic can be seen as one of the simplest special cases of action model logic (AML). However, so far no notion of relativized common knowledge has been proposed for AML in general. That is what we do in this paper. We propose a notion of action model relativized common knowledge for action model logic, and study expressive power and complete axiomatizations of resulting logics. Along the way we fill some gaps in existing expressivity results for standard relativized common knowledge.


      PubDate: 2015-06-20T05:43:26Z
       
  • Logic programming as classical inference
    • Abstract: Publication date: Available online 16 June 2015
      Source:Journal of Applied Logic
      Author(s): Eric A. Martin
      We propose a denotational semantics for logic programming based on a classical notion of logical consequence which is apt to capture the main proposed semantics of logic programs. In other words, we show that any of those semantics can be viewed as a relation of the form T ⊨ ⋆ X where T is a theory which naturally represents the logic program under consideration together with a set of formulas playing the role of “hypotheses”, in a way which is dictated by that semantics, ⊨ ⋆ is a notion of logical consequence which is classical because negation, disjunction and existential quantification receive their classical meaning, and X represents what can be inferred from the logic program, or an intended interpretation of that logic program (such as an answer-set, its well-founded model, etc.). The logical setting we propose extends the language of classical modal logic as it deals with modal operators indexed by ordinals. We make use of two kinds of basic modal formulas: □ α φ which intuitively means that the logical program can generate φ by stage α of the generation process, and ◇ α □ β φ with α > β , which intuitively means that φ can be used as a hypothesis from stage β of the generation process onwards, possibly expecting to confirm φ by stage α (so expecting □ α φ to be generated). This allows us to capture Rondogiannis and Wadge's version of the well-founded semantics [1] where a member of the well-founded model is a closed atom which receives an ordinal truth value of true α or false α for some ordinal α: in our framework, this corresponds to having T ⊨ ⋆ □ α φ or T ⊨ ⋆ □ α ¬ φ , respectively, with T being the natural representation of the logic program under consideration and the right set of “hypotheses” as dictated by the well-founded semantics. The framework we present goes much beyond the proposed traditional semantics for logic programming, as it can for instance let us investigate under which conditions a set of hypotheses can be minimal, with each hypothesis being activated as late as possible and confirmed as soon as possible, setting the theoretical foundation to sophisticated ways of making local use of hypotheses in knowledge-based systems, while still being theoretically grounded in a classical notion of logical consequence.


      PubDate: 2015-06-20T05:43:26Z
       
  • Automatic grape bunch detection in vineyards with an SVM classifier
    • Abstract: Publication date: Available online 9 June 2015
      Source:Journal of Applied Logic
      Author(s): Scarlett Liu , Mark Whitty
      Precise yield estimation in vineyards using image processing techniques has only been demonstrated conceptually on a small scale. Expanding this scale requires significant computational power where, by necessity, only small parts of the images of vines contain useful features. This paper introduces an image processing algorithm combining colour and texture information and the use of a support vector machine, to accelerate fruit detection by isolating and counting bunches in images. Experiments carried out on two varieties of red grapes (Shiraz and Cabernet Sauvignon) demonstrate an accuracy of 88.0% and recall of 91.6%. This method is also shown to remove the restriction on the field of view and background which plagued existing methods and is a first step towards precise and reliable yield estimation on a large scale.


      PubDate: 2015-06-13T05:00:14Z
       
  • The eco-cognitive model of abduction Aπαγωγή
           now: Naturalizing the logic of abduction
    • Abstract: Publication date: Available online 26 May 2015
      Source:Journal of Applied Logic
      Author(s): Lorenzo Magnani
      Abduction ( , in ancient Greek, often translated with “leading away” or “reduction”) is a procedure in which something that lacks classical explanatory epistemic virtue can be accepted because it has virtue of another kind: [15] contend (GW-Schema) that abduction presents an ignorance-preserving or (ignorance-mitigating) character. From this perspective abductive reasoning is a response to an ignorance-problem; through abduction the basic ignorance – that does not have to be considered a total “ignorance” – is neither solved nor left intact. Abductive reasoning is an ignorance-preserving accommodation of the problem at hand. Is abduction really ignorance-preserving? To better answer this question I will introduce (and take advantage of) an eco-cognitive model (EC-Model) of abduction. It will be illustrated that through abduction, knowledge can be enhanced, even when abduction is not considered an inference to the best explanation in the classical sense of the expression, that is an inference necessarily characterized by an empirical evaluation phase, or an inductive phase, as Peirce called it. To further deepen the eco-cognitive character of abduction a simple genealogy of logic is provided: Aristotle clearly states that in syllogistic theory local/environmental cognitive factors – external to that peculiar inferential process, for example regarding users/reasoners, are given up. Indeed, to define syllogism Aristotle first of all insists that all syllogisms are valid and contends that the necessity of this kind of reasoning is related to the circumstance that “no further term from outside is needed”, in sum syllogism is the fruit of a kind of eco-cognitive immunization. At the same time Aristotle presents a seminal perspective on abduction: the second part of the article considers the famous passage in the chapter B25 of Prior Analytics concerning (“leading away”), also studied by Peirce. I contend that some of the current well-known distinctive characters of abductive cognition are already expressed, which are in tune with the EC-Model. By providing an illustration of the role of the method of analysis and of the middle terms in Plato's dialectic argumentation, considered as related to the diorismic/poristic process in ancient geometry – also, later on, emphasized by Proclus – I maintain that it is just this intellectual heritage which informs Aristotle' chapter B25 on . Even if, in general, Aristotle seems to sterilize, thanks to the invention of syllogistic theory, every “dialectic” background of reasoning, nevertheless in chapter B25 he is still pointing to the fundamental inferential role in reasoning of those externalities that substantiate the process of “leading away” ( ). Hence, we can gain a new positive perspective about the “constitutive” eco-cognitive character of abduction, just thanks to Aristotle himself. Finally, the paper presents an excursus on Aristotle's enthymemes from signs, disregarded by Peirce, but extremely important to stress the Aristotelian treatment of what I have called selective abduction. A forthcoming companion paper ([35]) will further deepen the EC-Model of abduction stressing stricter logical aspects: the first result will be that, contrarily to the classical logical view, relevance and plausibility in abductive reasoning have to be relativized and so the epistemologically embarrassing concepts of irrelevance and implausibility exculpated: they are not always offensive to reason.


      PubDate: 2015-05-29T02:58:08Z
       
  • A concept approach to input/output logic
    • Abstract: Publication date: Available online 24 April 2015
      Source:Journal of Applied Logic
      Author(s): Audun Stolpe
      This paper provides a semantics for input/input output logic based on formal concept analysis. The central result shows that an input/output logic axiomatised by a relation R is the same as the logic induced by deriving pairs from the concept lattice generated by R using a ∧- and ∨-classical Scott consequence relation. This correspondence offers powerful analytical techniques for classifying, visualising and analysing input/output relations, revealing implicit hierarchical structure and/or natural clusterings and dependencies. The application of all formal developments are illustrated by a worked example towards the end.


      PubDate: 2015-05-16T01:04:45Z
       
  • Topological FLew-algebras
    • Abstract: Publication date: Available online 5 May 2015
      Source:Journal of Applied Logic
      Author(s): Jean B. Nganou , Serge F.T. Tebu
      The main goal of this article is to introduce topological FL ew -algebras and study their main properties. We also treat completions of FL ew -algebras with respect to inductive family of filters. This work generalizes similar works on MV-algebras [10] and on FL ew -algebras equipped with uniform topologies [9].


      PubDate: 2015-05-16T01:04:45Z
       
  • Gödel spaces and perfect MV-algebras
    • Abstract: Publication date: Available online 15 May 2015
      Source:Journal of Applied Logic
      Author(s): Antonio Di Nola , Revaz Grigolia
      The category of Gödel spaces GS (with strongly isotone maps as morphisms), which are dually equivalent to the category of Gödel algebras, is transferred by a contravariant functor H into the category M V ( C ) G of MV-algebras generated by perfect MV-chains via the operators of direct products, subalgebras and direct limits. Conversely, the category M V ( C ) G is transferred into the category GS by means of a contravariant functor P . Moreover, it is shown that the functor H is faithful, the functor P is full and the both functors are dense. The description of finite coproduct of algebras, which are isomorphic to Chang algebra, is given. Using duality a characterization of projective algebras in M V ( C ) G is given.


      PubDate: 2015-05-16T01:04:45Z
       
  • On classifying abduction
    • Abstract: Publication date: Available online 11 April 2015
      Source:Journal of Applied Logic
      Author(s): Woosuk Park
      We can witness the recent surge of interest in classifying different patterns or types of abduction. Many philosophers have suggested their own classifications emphasizing different aspects of abduction. Such a development is remarkable, in view of the fact that until quite recently the focus of the research on Peircean abduction was to identify its logical form. Another agenda in the recent attempts to classify abduction is whether to allow non-explanatory abductions. In order to resolve these two closely related issues, I propose to examine how Peirce would have responded to them. In particular, I suggest to do this in connection with Peirce's another life-long project, the classification of sciences. In this examination, it will be shown that Peirce struggled with the problem of conflating induction and abduction. I shall discuss how this problem influenced both Peirce's views on the interrelationship between abduction, deduction, and induction on the one hand, and his many classifications of sciences on the other. Also, the implication of the fundamental change in Peirce's views of abduction, deduction, and induction to the problem of the classification of sciences will be uncovered. Finally, I shall discuss whether inference to the best explanation is abduction. Insofar as this problem has bearing on the two controversial issues in classifying abduction, my negative answer will demonstrate that classifying abduction is yet to get off the ground.


      PubDate: 2015-04-12T07:14:51Z
       
  • Towards the logic of projective identification
    • Abstract: Publication date: Available online 25 March 2015
      Source:Journal of Applied Logic
      Author(s): Andriy Vasylchenko
      This paper is devoted to the ‘logic of the unconscious’ and its application to the analysis of projective intentionality in psychoanalysis. Subjective assumptions concerning the existence and identity of intentional objects are often unconscious. They result from personal experience through its assimilation and transformation in further psychological (e.g. defensive) processes. Formal aspects of these subjective assumptions and their influence on our judgment and action have been studied by a number of psychoanalytic authors, in particular by Silvano Arieti, Ignacio Matte-Blanco and their followers who tried to develop ‘logic of the unconscious’. My project consists in the reformulation, clarification and elaboration of the logic of the unconscious using contemporary modal and relevant logics, in particular Graham Priest's logic of intentionality. An important advantage of this logic is that it allows for truth indeterminacy and paraconsistency of the propositional content of intentional states. In this article I explore the logic of projective identification, which I assume plays the central role in the logic of the unconscious. Special attention is given to the logical analysis of the notion of an internal object, and to a logical reconstruction of the phantasy of projective identification.


      PubDate: 2015-04-04T06:34:03Z
       
  • Using inductive reasoning for completing OCF-networks
    • Abstract: Publication date: Available online 18 March 2015
      Source:Journal of Applied Logic
      Author(s): Christian Eichhorn , Gabriele Kern-Isberner
      OCF-networks provide the possibility to combine qualitative information expressed by rankings of (conditional) formulas with the strong structural information of a network, in this respect being a qualitative variant of the better known Bayesian networks. Like for Bayesian networks, a global ranking function can be calculated quickly and efficiently from the locally distributed information, whereas the latter significantly reduces the exponentially high complexity of the semantical ranking approach. This qualifies OCF-networks for applications. However, in practical applications the provided ranking information may not be in the format needed to be represented by an OCF-network, or some values may be simply missing. In this paper, we present techniques for filling in the missing values using methods of inductive reasoning and we elaborate on formal properties of OCF-networks.


      PubDate: 2015-03-19T04:33:00Z
       
  • Editorial: Uncertain reasoning at FLAIRS
    • Abstract: Publication date: Available online 17 March 2015
      Source:Journal of Applied Logic
      Author(s): Christoph Beierle , Cory Butz , Souhila Kaci



      PubDate: 2015-03-19T04:33:00Z
       
  • Learning discrete Bayesian network parameters from continuous data
           streams: What is the best strategy?
    • Abstract: Publication date: Available online 18 March 2015
      Source:Journal of Applied Logic
      Author(s): Parot Ratnapinda , Marek J. Druzdzel
      We compare three approaches to learning numerical parameters of discrete Bayesian networks from continuous data streams: (1) the EM algorithm applied to all data, (2) the EM algorithm applied to data increments, and (3) the online EM algorithm. Our results show that learning from all data at each step, whenever feasible, leads to the highest parameter accuracy and model classification accuracy. When facing computational limitations, incremental learning approaches are a reasonable alternative. While the differences in speed between incremental algorithms are not large (online EM is slightly slower), for all but small data sets online EM tends to be more accurate than incremental EM.


      PubDate: 2015-03-19T04:33:00Z
       
  • Conflict-free and conflict-tolerant semantics for constrained
           argumentation frameworks
    • Abstract: Publication date: Available online 18 March 2015
      Source:Journal of Applied Logic
      Author(s): Ofer Arieli
      In this paper we incorporate integrity constraints in abstract argumentation frameworks. Two types of semantics are considered for these constrained frameworks: conflict-free and conflict-tolerant. The first one is a conservative extension of standard approaches for giving coherent-based semantics to argumentation frameworks, where in addition certain constraints must be satisfied. A primary consideration behind this approach is a dismissal of any contradiction between accepted arguments of the constrained frameworks. The second type of semantics preserves contradictions, which are regarded as meaningful and sometimes even critical for the conclusions. We show that this approach is particularly useful for assuring the existence of non-empty extensions and for handling contradictions among the constraints, in which cases conflict-free extensions are not available. Both types of semantics are represented by propositional sets of formulas and are evaluated in the context of three-valued and four-valued logics. Among others, we show a one-to-one correspondence between the models of these theories, the extensions, and the labelings of the underlying constrained argumentation frameworks.


      PubDate: 2015-03-19T04:33:00Z
       
  • On the complexity of bribery and manipulation in tournaments with
           uncertain information
    • Abstract: Publication date: Available online 18 March 2015
      Source:Journal of Applied Logic
      Author(s): Nicholas Mattei , Judy Goldsmith , Andrew Klapper , Martin Mundhenk
      We study the computational complexity of bribery and manipulation schemes for sports tournaments with uncertain information. We introduce a general probabilistic model for multi-round tournaments and consider several special types of tournament: challenge (or caterpillar); cup; and round robin. In some ways, tournaments are similar to the sequential pair-wise, cup and Copeland voting rules. The complexity of bribery and manipulation are well studied for elections, usually assuming deterministic information about votes and results. We assume that for tournament entrants i and j, the probability that i beats j and the costs of lowering each probability by fixed increments are known to the manipulators. We provide complexity analyses for several problems related to manipulation and bribery for the various types of tournaments. Complexities range from probabilistic log space to NP PP . This shows that the introduction of uncertainty into the reasoning process drastically increases the complexity of bribery problems in some instances.


      PubDate: 2015-03-19T04:33:00Z
       
  • Robot location estimation in the situation calculus
    • Abstract: Publication date: Available online 23 February 2015
      Source:Journal of Applied Logic
      Author(s): Vaishak Belle , Hector J. Levesque
      Location estimation is a fundamental sensing task in robotic applications, where the world is uncertain, and sensors and effectors are noisy. Most systems make various assumptions about the dependencies between state variables, and especially about how these dependencies change as a result of actions. Building on a general framework by Bacchus, Halpern and Levesque for reasoning about degrees of belief in the situation calculus, and a recent extension to it for continuous probability distributions, in this paper we illustrate location estimation in the presence of a rich theory of actions using examples. The formalism also allows specifications with incomplete knowledge and strict uncertainty, as a result of which the agent's initial beliefs need not be characterized by a unique probability distribution. Finally, we show that while actions might affect prior distributions in nonstandard ways, suitable posterior beliefs are nonetheless entailed as a side-effect of the overall specification.


      PubDate: 2015-03-15T03:34:10Z
       
  • A labeled argumentation framework
    • Abstract: Publication date: Available online 25 February 2015
      Source:Journal of Applied Logic
      Author(s): Maximiliano C.D. Budán , Mauro Gómez Lucero , Ignacio Viglizzo , Guillermo R. Simari
      To increase the expressivity of an argumentation formalism, we propose adding meta-level information to the arguments in the form of labels representing quantifiable data such as reliability degree, strength measure, skill, time availability, or any other feature about arguments. The extra information attached to an argument is then used in the acceptability determination process. We present a Labeled Argumentation Framework (LAF), combining the knowledge representation capabilities provided by the Argument Interchange Format (AIF) with an Algebra of Argumentation Labels, enabling us to handle the labels associated with the arguments. These labels are propagated through an argumentative graph according to the relations of support, conflict, and aggregation between arguments. Through this process we obtain final labels attached to the arguments that are useful to determine their acceptability.


      PubDate: 2015-03-15T03:34:10Z
       
  • Reflecting rules: A note on generalizing the deduction theorem
    • Abstract: Publication date: Available online 6 March 2015
      Source:Journal of Applied Logic
      Author(s): Gillman Payette
      The purpose of this brief note is to prove a limitative theorem for a generalization of the deduction theorem. I discuss the relationship between the deduction theorem and rules of inference. Often when the deduction theorem is claimed to fail, particularly in the case of normal modal logics, it is the result of a confusion over what the deduction theorem is trying to show. The classic deduction theorem is trying to show that all so-called ‘derivable rules’ can be encoded into the object language using the conditional. The deduction theorem can be generalized in the sense that one can attempt to encode all types of rules into the object language. When a rule is encoded in this way I say that it is reflected in the object language. What I show, however, is that certain logics which reflect a certain kind of rule must be trivial. Therefore, my generalization of the deduction theorem does fail where the classic deduction theorem didn't.


      PubDate: 2015-03-15T03:34:10Z
       
  • Automatic non-linear analysis of non-invasive writing signals, applied to
           essential tremor
    • Abstract: Publication date: Available online 6 March 2015
      Source:Journal of Applied Logic
      Author(s): K. Lopez-de-Ipiña , A. Bergareche , P. de la Riva , M. Faundez-Zanuy , P.M. Calvo , J. Roure , E. Sesa-Nogueras
      Essential tremor (ET) in the western world is the most common movement disorder, and 50–70% of essential tremor cases are estimated to be genetic in origin [1]. 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 leaded by Biodonostia Institute. These biomarkers include not only classic linear features, but also non-linear: fractal dimension and entropy. The presence of integrated features of other diseases such as stress is also analyzed. In future works, these new biomarkers will be integrated with the ones obtained in the wider study of Biodonostia. Note that the use of these methods provide undoubted benefits towards the development of more sustainable, low cost, high quality, and non-invasive technologies. These systems are easily adaptable to the user and environment, and can be very useful in real complex environments with regard to a social and economic point of view.


      PubDate: 2015-03-15T03:34:10Z
       
  • The complement of a point subset in a projective space and a Grassmann
           space
    • Abstract: Publication date: September 2015
      Source:Journal of Applied Logic, Volume 13, Issue 3
      Author(s): Krzysztof Petelczyc , Mariusz Żynel
      In a projective space we fix some set of points, a horizon, and investigate the complement of that horizon. We prove, under some assumptions on the size of lines, that the ambient projective space, together with its horizon, both can be recovered in that complement. Then we apply this result to show something similar for Grassmann spaces.


      PubDate: 2015-03-15T03:34:10Z
       
  • Editorial Board
    • Abstract: Publication date: June 2015
      Source:Journal of Applied Logic, Volume 13, Issue 2, Part A




      PubDate: 2015-03-15T03:34:10Z
       
  • Simplified method based on an intelligent model to obtain the extinction
           angle of the current for a single-phase half wave controlled rectifier
           with resistive and inductive load
    • Abstract: Publication date: June 2015
      Source:Journal of Applied Logic, Volume 13, Issue 2, Part A
      Author(s): José Luis Calvo-Rolle , Héctor Quintian-Pardo , Emilio Corchado , María del Carmen Meizoso-López , Ramón Ferreiro García



      PubDate: 2015-03-15T03:34:10Z
       
  • Editorial: Weighted logics for artificial intelligence – 2
    • Abstract: Publication date: Available online 10 March 2015
      Source:Journal of Applied Logic
      Author(s): Lluis Godo , Henri Prade , Guilin Qi



      PubDate: 2015-03-15T03:34:10Z
       
  • Editorial Board
    • Abstract: Publication date: March 2015
      Source:Journal of Applied Logic, Volume 13, Issue 1




      PubDate: 2015-02-03T06:04:08Z
       
  • Equations for formally real meadows
    • Abstract: Publication date: Available online 26 January 2015
      Source:Journal of Applied Logic
      Author(s): Jan A. Bergstra , Inge Bethke , Alban Ponse
      We consider the signatures Σ m = ( 0 , 1 , − , + , ⋅ , − 1 ) of meadows and ( Σ m , s ) of signed meadows. We give two complete axiomatizations of the equational theories of the real numbers with respect to these signatures. In the first case, we extend the axiomatization of zero-totalized fields by a single axiom scheme expressing formal realness; the second axiomatization presupposes an ordering. We apply these completeness results in order to obtain complete axiomatizations of the complex numbers.


      PubDate: 2015-01-28T05:33:40Z
       
  • Similarity-based relaxed instance queries
    • Abstract: Publication date: Available online 19 January 2015
      Source:Journal of Applied Logic
      Author(s): Andreas Ecke , Rafael Peñaloza , Anni-Yasmin Turhan
      In Description Logics (DL) knowledge bases (KBs), information is typically captured by clear-cut concepts. For many practical applications querying the KB by crisp concepts is too restrictive; a user might be willing to lose some precision in the query, in exchange of a larger selection of answers. Similarity measures can offer a controlled way of gradually relaxing a query concept within a user-specified limit. In this paper we formalize the task of instance query answering for DL KBs using concepts relaxed by concept similarity measures (CSMs). We investigate computation algorithms for this task in the DL EL , their complexity and properties for the CSMs employed regarding whether unfoldable or general TBoxes are used. For the case of general TBoxes we define a family of CSMs that take the full TBox information into account, when assessing the similarity of concepts.


      PubDate: 2015-01-23T05:04:29Z
       
  • The fallacy of composition: Guiding concepts, historical cases, and
           research problems
    • Abstract: Publication date: Available online 20 January 2015
      Source:Journal of Applied Logic
      Author(s): Maurice A. Finocchiaro
      Although the fallacy of composition is little studied by theorists and trivially illustrated in textbooks, some view it as ubiquitous and highly significant. Furthermore, although definitions regard the concept as unproblematic, it contains three distinct elements that are often confused, and is often carelessly conflated with the fallacy of division. And although some apparently claim that fallacies are figments of a critic's imagination, they are really proposing to study fallacies in the context of meta-argumentation. Guided by these ideas, I find three important historical examples: Aristotle's geocentric argument from natural motion, as critiqued by Galileo; a step in the theological argument from design, as critiqued by Hume; and Michels's iron law of oligarchy, as critiqued by social scientists Dahl and Lipset. Finally, I formulate some problems for future research on compositional arguments: distinguishing incorrectness from fallaciousness; elaborating general principles of evaluation; clarifying the three distinct subtypes; shifting from the arbitrary pluralism of argument-identification to the normal meta-argumentation of argument-analysis; and further historical-empirical search for such fallacies in various controversies, over holism, over global warming, and over national debts.


      PubDate: 2015-01-23T05:04:29Z
       
  • A concept for the evolution of relational probabilistic belief states and
           the computation of their changes under optimum entropy semantics
    • Abstract: Publication date: Available online 8 January 2015
      Source:Journal of Applied Logic
      Author(s): Nico Potyka , Christoph Beierle , Gabriele Kern-Isberner
      Coping with uncertain knowledge and changing beliefs is essential for reasoning in dynamic environments. We generalize an approach to adjust probabilistic belief states by use of the relative entropy in a propositional setting to relational languages, leading to a concept for the evolution of relational probabilistic belief states. As a second contribution of this paper, we present a method to compute the corresponding belief state changes by considering a dual problem and present first application and experimental results. The computed belief state usually factorizes and we explain how the factorization can be exploited to store the belief state more compactly and to simplify its computation by exploiting equivalences of worlds. Finally, we present results on the computational complexity of determining equivalence classes.


      PubDate: 2015-01-09T04:03:26Z
       
  • Abduction: A categorical characterization
    • Abstract: Publication date: Available online 7 January 2015
      Source:Journal of Applied Logic
      Author(s): Fernando Tohmé , Gianluca Caterina , Rocco Gangle
      Scientific knowledge is gained by the informed (on the basis of theoretic ideas and criteria) examination of data. This can be easily seen in the context of quantitative data, handled with statistical methods. Here we are interested in other forms of data analysis, although with the same goal of extracting meaningful information. The idea is that data should guide the construction of suitable models, which later may lead to the development of new theories. This kind of inference is called abduction and constitutes a central procedure called Peircean qualitative induction. In this paper we will present a category-theoretic representation of abduction based on the notion of adjunction, which highlights the fundamental fact that an abduction is the most efficient way of capturing the information obtained from a large body of evidence.


      PubDate: 2015-01-09T04:03:26Z
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015