for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> ENGINEERING (Total: 2291 journals)
    - CHEMICAL ENGINEERING (192 journals)
    - CIVIL ENGINEERING (187 journals)
    - ELECTRICAL ENGINEERING (105 journals)
    - ENGINEERING (1209 journals)
    - HYDRAULIC ENGINEERING (55 journals)
    - INDUSTRIAL ENGINEERING (68 journals)
    - MECHANICAL ENGINEERING (90 journals)

ENGINEERING (1209 journals)            First | 1 2 3 4 5 6 7 | Last

Showing 1001 - 1200 of 1205 Journals sorted alphabetically
Process Technology Proceedings     Full-text available via subscription  
Processes     Open Access  
Production     Open Access  
Production and Operations Management     Hybrid Journal   (Followers: 13)
Production Engineering     Hybrid Journal   (Followers: 5)
Production Planning & Control: The Management of Operations     Hybrid Journal   (Followers: 10)
Progress in Agricultural Engineering Sciences     Full-text available via subscription  
Progress in Computational Fluid Dynamics, An International Journal     Hybrid Journal   (Followers: 7)
Progress in Energy and Combustion Science     Full-text available via subscription   (Followers: 10)
Progress in Nanotechnology and Nanomaterials     Open Access   (Followers: 4)
Progress in Photovoltaics: Research & Applications     Hybrid Journal   (Followers: 6)
Progress in Polymer Science     Full-text available via subscription   (Followers: 34)
Propellants, Explosives, Pyrotechnics     Hybrid Journal   (Followers: 294)
Propulsion and Power Research     Open Access   (Followers: 26)
Puente     Open Access  
Purinergic Signalling     Hybrid Journal   (Followers: 1)
Quaderns d’Història de l’Enginyeria     Open Access  
Quality and Reliability Engineering International     Hybrid Journal   (Followers: 14)
Quality Engineering     Hybrid Journal   (Followers: 9)
Radiochimica Acta     Hybrid Journal   (Followers: 5)
Rapid Prototyping Journal     Hybrid Journal   (Followers: 4)
Rare Metals     Hybrid Journal   (Followers: 1)
Reactive and Functional Polymers     Hybrid Journal   (Followers: 5)
Recent Patents on Engineering     Full-text available via subscription   (Followers: 3)
Recent Patents on Nanotechnology     Full-text available via subscription   (Followers: 3)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 1)
Redes de Ingeniería     Open Access  
Regional Maritime University Journal     Full-text available via subscription   (Followers: 2)
Regular and Chaotic Dynamics     Hybrid Journal  
Rekayasa     Open Access  
Rem : Revista Escola de Minas     Open Access   (Followers: 1)
Remote Sensing     Open Access   (Followers: 45)
Remote Sensing Letters     Hybrid Journal   (Followers: 40)
Requirements Engineering     Hybrid Journal   (Followers: 3)
Research Ideas and Outcomes     Open Access  
Research in Engineering Design     Hybrid Journal   (Followers: 11)
Research Journal of Nanoscience and Nanotechnology     Open Access   (Followers: 20)
Research Works of Air Force Institute of Technology     Open Access   (Followers: 1)
Resonance     Hybrid Journal   (Followers: 29)
Reviews in Advanced Sciences and Engineering     Partially Free   (Followers: 2)
Revista AIDIS de Ingeniería y Ciencias Ambientales. Investigación, desarrollo y práctica     Open Access  
Revista Brasileira de Engenharia Agrícola e Ambiental     Open Access   (Followers: 1)
Revista Ciencias e Ingeniería al Día     Open Access  
Revista CINTEX     Open Access   (Followers: 1)
Revista de Engenharia da Universidade Católica de Petrópolis     Open Access  
Revista de Ingeniería     Open Access  
Revista de Ingenieria Sismica     Open Access  
Revista de Investigación, Desarrollo e Innovación     Open Access  
Revista EIA     Open Access   (Followers: 1)
Revista Facultad de Ingeniería     Open Access   (Followers: 1)
Revista Facultad de Ingenieria - Universidad de Tarapaca     Open Access   (Followers: 1)
Revista Facultad de Ingeniería Universidad de Antioquia     Open Access   (Followers: 1)
Revista Fatec Zona Sul : REFAS     Open Access  
Revista Iberoamericana de Automática e Informática Industrial RIAI     Open Access  
Revista Informador Técnico     Open Access   (Followers: 1)
Revista Ingenieria de Construcción     Open Access   (Followers: 1)
Revista Internacional de Métodos Numéricos para Cálculo y Diseño en Ingeniería     Open Access   (Followers: 1)
Revista Logos Ciencia & Tecnología     Open Access   (Followers: 1)
Revue de Métallurgie     Full-text available via subscription  
Russian Engineering Research     Hybrid Journal  
Russian Journal of Non-Ferrous Metals     Hybrid Journal   (Followers: 23)
Russian Microelectronics     Hybrid Journal   (Followers: 1)
Sadhana     Open Access   (Followers: 9)
Safety Science     Hybrid Journal   (Followers: 31)
Scholedge International Journal of Multidisciplinary & Allied Studies     Open Access   (Followers: 3)
Science & Technique     Open Access  
Science and Education : Scientific Publication of BMSTU     Open Access  
Science and Engineering Ethics     Hybrid Journal   (Followers: 9)
Science and Technology     Open Access   (Followers: 2)
Science China Technological Sciences     Hybrid Journal  
Science Journal of Volgograd State University. Technology and innovations     Open Access  
Science Progress     Full-text available via subscription   (Followers: 2)
Scientia cum Industria     Open Access  
Scientific Drilling     Open Access  
Scientific Journal of Control Engineering     Open Access   (Followers: 1)
Scientific Journal of Pure and Applied Sciences     Open Access   (Followers: 1)
Sealing Technology     Full-text available via subscription   (Followers: 1)
Securitas Vialis     Hybrid Journal  
Security and Communication Networks     Hybrid Journal   (Followers: 3)
Selcuk University Journal of Engineering, Science and Technology     Open Access  
Selected Topics in Applied Earth Observations and Remote Sensing, IEEE Journal of     Hybrid Journal   (Followers: 51)
Semiconductors     Hybrid Journal  
Semiconductors and Semimetals     Full-text available via subscription   (Followers: 1)
Sensing and Imaging : An International Journal     Hybrid Journal   (Followers: 2)
Sensor Letters     Full-text available via subscription   (Followers: 2)
Sensors     Open Access   (Followers: 19)
Separation and Purification Technology     Hybrid Journal   (Followers: 10)
Services Computing, IEEE Transactions on     Hybrid Journal   (Followers: 5)
Shock and Vibration     Hybrid Journal   (Followers: 13)
SIAM Journal on Applied Dynamical Systems     Hybrid Journal   (Followers: 2)
SIAM Journal on Mathematical Analysis     Hybrid Journal   (Followers: 3)
SIAM Journal on Matrix Analysis and Applications     Hybrid Journal   (Followers: 1)
SIAM Journal on Numerical Analysis     Hybrid Journal   (Followers: 5)
SIAM Journal on Optimization     Hybrid Journal   (Followers: 8)
SIAM Review     Hybrid Journal   (Followers: 6)
SILICON     Hybrid Journal  
Sistemas & Telemática     Open Access   (Followers: 2)
Sleep and Biological Rhythms     Hybrid Journal   (Followers: 6)
Small     Hybrid Journal   (Followers: 10)
Smart Grid     Open Access  
Soft Computing     Hybrid Journal   (Followers: 8)
Software Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 70)
Soil Dynamics and Earthquake Engineering     Hybrid Journal   (Followers: 15)
Soldagem & Inspeção     Open Access  
Solid-State Circuits Magazine, IEEE     Hybrid Journal   (Followers: 12)
SourceOCDE Developpement urbain, rural et regional     Full-text available via subscription   (Followers: 1)
SourceOCDE Energie     Full-text available via subscription  
SourceOECD Energy     Full-text available via subscription  
SourceOECD Science and Technology Statistics - SourceOCDE Base de donnees des sciences et de la technologie     Full-text available via subscription  
SourceOECD Transport     Full-text available via subscription   (Followers: 3)
SourceOECD Urban, Rural and Regional Development     Full-text available via subscription   (Followers: 1)
South African Computer Journal     Full-text available via subscription  
South African Journal of Agricultural Extension     Open Access   (Followers: 4)
South African Journal of Science     Open Access   (Followers: 3)
Sports Engineering     Hybrid Journal   (Followers: 2)
Stahlbau     Hybrid Journal   (Followers: 3)
Steel in Translation     Hybrid Journal  
Steel Research International     Hybrid Journal   (Followers: 25)
Stochastic Analysis and Applications     Hybrid Journal   (Followers: 2)
Stochastic Processes and their Applications     Hybrid Journal   (Followers: 5)
Stochastics and Dynamics     Hybrid Journal  
Strain     Hybrid Journal   (Followers: 2)
Strategic Planning for Energy and the Environment     Hybrid Journal   (Followers: 4)
Studies in Engineering and Technology     Open Access  
Studies in Interface Science     Full-text available via subscription   (Followers: 1)
Studies in Logic and Practical Reasoning     Full-text available via subscription  
Studies in Surface Science and Catalysis     Full-text available via subscription   (Followers: 1)
Sud-Sciences et Technologies     Open Access  
Superconductor Science and Technology     Hybrid Journal   (Followers: 2)
Surface Engineering     Hybrid Journal   (Followers: 3)
Surface Review and Letters     Hybrid Journal  
Surface Science Reports     Full-text available via subscription   (Followers: 20)
Survey Review     Hybrid Journal   (Followers: 6)
Surveying and Land Information Science     Full-text available via subscription   (Followers: 1)
Sustainability Science     Hybrid Journal   (Followers: 8)
Sustainability Science and Engineering     Full-text available via subscription   (Followers: 4)
Sustainable Management of Sediment Resources     Full-text available via subscription  
Swiss Journal of Geosciences     Hybrid Journal   (Followers: 1)
Symmetry     Open Access  
Synthesis Lectures on Algorithms and Software in Engineering     Full-text available via subscription   (Followers: 3)
Synthesis Lectures on Antennas     Full-text available via subscription   (Followers: 6)
Synthesis Lectures on Biomedical Engineering     Full-text available via subscription  
Synthesis Lectures on Computational Electromagnetics     Full-text available via subscription   (Followers: 5)
Synthesis Lectures on Energy and the Environment: Technology, Science, and Society     Full-text available via subscription   (Followers: 2)
Synthesis Lectures on Engineering     Full-text available via subscription  
Synthesis Lectures on Global Engineering     Full-text available via subscription  
Synthesis Lectures on Professionalism and Career Advancement for Scientists and Engineers     Full-text available via subscription   (Followers: 2)
Synthetic Metals     Hybrid Journal   (Followers: 4)
Systems Engineering     Hybrid Journal   (Followers: 6)
Systems Engineering Procedia     Open Access  
Systems Research Forum     Hybrid Journal  
Systems Science & Control Engineering     Open Access   (Followers: 6)
Technological Engineering     Open Access  
Technologies     Open Access   (Followers: 1)
TECHNOLOGY     Hybrid Journal  
Technology and Innovation     Full-text available via subscription   (Followers: 3)
Technology in Society     Hybrid Journal   (Followers: 4)
Technometrics     Full-text available via subscription   (Followers: 6)
Tecnologia, Ciencia, Educacion     Open Access   (Followers: 1)
Tecnura     Open Access  
Telecommunications Policy     Hybrid Journal   (Followers: 33)
Terahertz Science and Technology, IEEE Transactions on     Hybrid Journal   (Followers: 2)
Textile Science and Technology     Full-text available via subscription   (Followers: 4)
The Journal of Supercomputing     Hybrid Journal   (Followers: 1)
The Scientific World Journal     Open Access  
Theoretical and Computational Fluid Dynamics     Hybrid Journal   (Followers: 15)
Theoretical Issues in Ergonomics Science     Hybrid Journal   (Followers: 5)
Thermal Engineering     Hybrid Journal   (Followers: 8)
Tikrit Journal of Engineering Science     Open Access  
tm - Technisches Messen     Hybrid Journal   (Followers: 3)
Topics in Catalysis     Hybrid Journal   (Followers: 1)
Traffic Injury Prevention     Hybrid Journal   (Followers: 64)
TRANSACTIONS of the VŠB - Technical University of Ostrava, Safety Engineering Series     Open Access   (Followers: 1)
Transactions of Tianjin University     Full-text available via subscription  
Transport and Telecommunication Journal     Open Access   (Followers: 4)
Transport World Africa     Full-text available via subscription   (Followers: 3)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 34)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 5)
Trends in Applied Sciences Research     Open Access   (Followers: 1)
Tribology in Industry     Open Access   (Followers: 1)
Tribology International     Hybrid Journal   (Followers: 43)
Tribology Letters     Hybrid Journal   (Followers: 5)
Tribology Transactions     Hybrid Journal   (Followers: 33)
Ultramicroscopy     Hybrid Journal   (Followers: 2)
Uludağ University Journal of The Faculty of Engineering     Open Access  
Universal Journal of Applied Science     Open Access   (Followers: 2)
Universal Journal of Engineering Science     Open Access   (Followers: 1)
Utilities Policy     Hybrid Journal   (Followers: 2)
Vacuum     Hybrid Journal   (Followers: 12)
Virtual and Physical Prototyping     Hybrid Journal   (Followers: 3)
Visualization in Engineering     Open Access  
Walailak Journal of Science and Technology     Open Access  
Waste and Biomass Valorization     Hybrid Journal   (Followers: 2)
Waste Management Series     Full-text available via subscription   (Followers: 2)
Waves in Random and Complex Media     Hybrid Journal  
Waves, Wavelets and Fractals     Open Access  
Wear     Hybrid Journal   (Followers: 28)
Welding in the World     Hybrid Journal   (Followers: 6)
West African Journal of Industrial and Academic Research     Open Access   (Followers: 1)
Women in Engineering Magazine, IEEE     Full-text available via subscription   (Followers: 13)

  First | 1 2 3 4 5 6 7 | Last

Journal Cover Journal of Applied Logic
  [SJR: 0.753]   [H-I: 22]   [0 followers]  Follow
   Full-text available via subscription Subscription journal
   ISSN (Print) 1570-8683
   Published by Elsevier Homepage  [3043 journals]
  • Special issue SOCO14-JAL
    • Authors: Pablo García Bringas; Asier Perallos Ruiz; Antonio D. Masegosa Arredondo; Álvaro Herrero; Héctor Quintián; Emilio Corchado
      Pages: 1 - 3
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Pablo García Bringas, Asier Perallos Ruiz, Antonio D. Masegosa Arredondo, Álvaro Herrero, Héctor Quintián, Emilio Corchado

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.008
      Issue No: Vol. 24 (2017)
  • Using the finite element method and data mining techniques as an
           alternative method to determine the maximum load capacity in tapered
           roller bearings
    • Authors: Ruben Lostado-Lorza; Ruben Escribano-Garcia; Roberto Fernandez-Martinez; Marcos Illera-cueva; Bryan J. Mac Donald
      Pages: 4 - 14
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Ruben Lostado-Lorza, Ruben Escribano-Garcia, Roberto Fernandez-Martinez, Marcos Illera-cueva, Bryan J. Mac Donald
      Double-row tapered roller bearings (TRBs) are mechanical devices designed to support a combination of preload, radial load, axial load and torque. They are widely used in vehicles for high load and moderate rotation speeds. This combination of loads produces high contact stresses on the bearing raceways that are difficult to calculate, and can cause undesirable defects like fatigue spalling and pitting. In recent decades, the Finite Element Method (FEM) has been used to obtain the distribution of the contact stresses on each of the raceways, although this method has the disadvantage of a high computational cost. The myriad of possible combinations of input loads on the TRB (preload, radial load, axial load and torque) makes it much harder to calculate the distribution of these contact stresses. This paper proposes a methodology that combines the FEM and data mining techniques to determine the maximum load capacity in TRBs. First, a three-dimensional finite element (FE) model was generated according to the real materials' properties, geometry and coefficients of friction of all parts that make up the double-row TRB. Subsequently, a Design of Experiment (DoE) was completed that considered a combination of the mentioned input loads, which were simulated in the FE model. Based on the contact stresses obtained from the FE simulations, a group of regression models – linear regression (LR), Gaussian processes (GP), artificial neural networks (ANN), support vector machines (SVM) and regression trees (RT) – were built to predict the contact stresses ratios that act on each of the row of rollers in the outer raceway of the TRB. Finally, the best combination of input loads was achieved by applying evolutionary optimization techniques based on genetic algorithms (GA) to the best regression models previously obtained. The maximum load capacity of the TRB was achieved when the radial load obtained was a maximum, while the stresses ratios of the two contacts in the outer raceway of the TRB were close to 25%.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.009
      Issue No: Vol. 24 (2017)
  • A survey on the inventory-routing problem with stochastic lead times and
    • Authors: Raúl F. Roldán; Rosa Basagoiti; Leandro C. Coelho
      Pages: 15 - 24
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Raúl F. Roldán, Rosa Basagoiti, Leandro C. Coelho
      The integration of the different processes and players that compose the supply chain (SC) is essential to obtain a better coordination level. Inventory control and distribution management are the two processes that researchers have identified as the key to gain or lose in efficiency and effectiveness in the field of logistics, with a direct effect on the synchronization and overall performance of SCs. In practical situations demand is often not deterministic, and lead times are also variable, yielding a complex stochastic problem. In order to analyze the recent developments in the integration of these processes, this paper analyzes the state of the art of the information management in the SC, the relationship between inventory policies and available demand information, and the use of optimization methods to provide good solutions for the problem in single and multi depot versions.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.010
      Issue No: Vol. 24 (2017)
  • The modelling and design process of coordination mechanisms in the supply
    • Authors: Katarzyna Grzybowska; Gábor Kovács
      Pages: 25 - 38
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Katarzyna Grzybowska, Gábor Kovács
      The process description languages, which are used in business, may be useful in logistics processes. The planning, organisation, direction and the control of the logistics processes might be more efficient if these formal languages are applied. During the logistics processes, many problems might arise, which should have already been addressed in the planning phase. In our days, the symptomatic treatment is a common practice, but it does not provide predictability. The obvious solution would be process control, in order to handle the main sources of faults and to give a correct list of what needs to be done during the logistics process. The process description languages may be useful not only in standardisation, but they may also help to avoid losses. Simulation experiments, on the basis of built model, also allow for the elimination of problems, standardisation and the limitation of losses. The aim of the article is a discussion of selected coordination mechanisms in the supply chain, its modelling in the form of a reference, as well as a discussion of the simulation experiment with the use of the FlexSim tool.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.011
      Issue No: Vol. 24 (2017)
  • Evolutionary simulation of complex networks' structures with specific
           functional properties
    • Authors: Victor V. Kashirin; Anastasia A. Lantseva; Sergey V. Ivanov; Sergey V. Kovalchuk; Alexander V. Boukhanovsky
      Pages: 39 - 49
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Victor V. Kashirin, Anastasia A. Lantseva, Sergey V. Ivanov, Sergey V. Kovalchuk, Alexander V. Boukhanovsky
      Thorough studies of technological and biological systems have revealed that the inherent networking structures of those systems possess similar topological properties, like node degree distribution or small-world effect, regardless of the context to which those systems are related. Based on that knowledge, there have been numerous attempts to develop models that capture particular topological properties of observed complex networks, although little attention has been paid to developing models with specific functional properties. The present paper proposes a method for the simulation of networks' structures with functional characteristics of interest using a heuristic evolutionary approach and utilizing a Simulated Annealing algorithm. An experimental study is carried out with a US air transportation network and synthetic social networks with known properties.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.012
      Issue No: Vol. 24 (2017)
  • Hybrid evolutionary workflow scheduling algorithm for dynamic
           heterogeneous distributed computational environment
    • Authors: D. Nasonov; A. Visheratin; N. Butakov; N. Shindyapina; M. Melnik; A. Boukhanovsky
      Pages: 50 - 61
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): D. Nasonov, A. Visheratin, N. Butakov, N. Shindyapina, M. Melnik, A. Boukhanovsky
      The optimal workflow scheduling is one of the most important issues in heterogeneous distributed computational environments. Existing heuristic and evolutionary scheduling algorithms have their advantages and disadvantages. In this work we propose a hybrid algorithm based on heuristic methods and genetic algorithm (GA) that combines best characteristics of both approaches. We propose heuristic algorithm called Linewise Earliest Finish Time (LEFT) as an alternative for HEFT in initial population generation for GA. We also experimentally show efficiency of described hybrid schemas GAHEFT, GALEFT, GACH for traditional workflow scheduling as well as for variable workload in dynamically changing heterogeneous computational environment.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.013
      Issue No: Vol. 24 (2017)
  • A brief review of the ear recognition process using deep neural networks
    • Authors: Pedro Luis Galdámez; William Raveane; Angélica González Arrieta
      Pages: 62 - 70
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Pedro Luis Galdámez, William Raveane, Angélica González Arrieta
      The process of precisely recognize people by ears has been getting major attention in recent years. It represents an important step in the biometric research, especially as a complement to face recognition systems which have difficult in real conditions. This is due to the great variation in shapes, variable lighting conditions, and the changing profile shape which is a planar representation of a complex object. An ear recognition system involving a convolutional neural networks (CNN) is proposed to identify a person given an input image. The proposed method matches the performance of other traditional approaches when analyzed against clean photographs. However, the F1 metric of the results shows improvements in specificity of the recognition. We also present a technique for improving the speed of a CNN applied to large input images through the optimization of the sliding window approach.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.014
      Issue No: Vol. 24 (2017)
  • On the combination of support vector machines and segmentation algorithms
           for anomaly detection: A petroleum industry comparative study
    • Authors: Luis Martí; Nayat Sanchez-Pi; José Manuel Molina López; Ana Cristina Bicharra Garcia
      Pages: 71 - 84
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Luis Martí, Nayat Sanchez-Pi, José Manuel Molina López, Ana Cristina Bicharra Garcia
      Anomaly detection has to do with finding patterns in data that do not conform to an expected behavior. It has recently attracted the attention of the research community because of its real-world application. The correct detection unusual events empower the decision maker with the capacity to act on the system in order to correctly avoid, correct, or react to the situations associated with them. Petroleum industry is one of such real-world application scenarios. In particular, heavy extraction machines for pumping and generation operations like turbomachines are intensively monitored by hundreds of sensors each that send measurements with a high frequency for damage prevention. For dealing with this and with the lack of labeled data, in this paper we describe a combination of a fast and high quality segmentation algorithm with a one-class support vector machine approach for efficient anomaly detection in turbomachines. As a result we perform empirical studies comparing our approach to another using Kalman filters in a real-life application related to oil platform turbomachinery anomaly detection.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.015
      Issue No: Vol. 24 (2017)
  • 50 years of fuzzy set theory and models for supplier assessment and
           selection: A literature review
    • Authors: Dragan Simić; Ilija Kovačević; Vasa Svirčević; Svetlana Simić
      Pages: 85 - 96
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Dragan Simić, Ilija Kovačević, Vasa Svirčević, Svetlana Simić
      Supplier assessment and selection mapping as an essential component of supply chain management are usually multi-criteria decision-making problems. Decision making is the thought process of selecting a logical choice from the available options. This is generally made under fuzzy environment. Fuzzy decision-making is a decision process using the sets whose boundaries are not sharply defined. The aim of this paper is to show how fuzzy set theory, fuzzy decision-making and hybrid solutions based on fuzzy can be used in the various models for supplier assessment and selection in a 50 year period.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.016
      Issue No: Vol. 24 (2017)
  • Sensorless control of variable speed induction motor drive using RBF
           neural network
    • Authors: Pavel Brandstetter; Martin Kuchar
      Pages: 97 - 108
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Pavel Brandstetter, Martin Kuchar
      High power of modern digital signal processors and their decreasing prices enable practical implementation of different speed estimators which are used in the sensorless control of AC drives. The paper describes application possibilities of artificial neural networks for the sensorless speed control of the A.C. induction motor drive. In the sensorless control structure of the A.C. drive, there is implemented the speed estimator which uses two different artificial neural networks for speed estimation. The first speed estimator uses a multilayer feedforward artificial neural network. Its properties are compared with the speed estimator using a radial basis function neural network. The sensorless A.C. drive was simulated in program Matlab-Simulink. The main goal of many simulations was finding suitable structure of the artificial neural network with required number of neuron units which will ensure good control characteristics and simultaneously will enable a practical implementation of the artificial neural network in the digital signal processor control system.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.017
      Issue No: Vol. 24 (2017)
  • Comparison of classification techniques applied for network intrusion
           detection and classification
    • Authors: Amira Sayed A. Aziz; Sanaa EL-Ola Hanafi; Aboul Ella Hassanien
      Pages: 109 - 118
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Amira Sayed A. Aziz, Sanaa EL-Ola Hanafi, Aboul Ella Hassanien
      In a previous research, a multi-agent artificial immune system for network intrusion detection and classification was proposed and tested, where a multi-layer detection and classification process was executed on each agent, for each host in the network. In this paper, we show the experiments that were held to chose the appropriate classifiers by testing different classifiers and comparing them to increase the detection accuracy and obtain more information on the detected anomalies. It will be shown that no single classifier should be used for all types of attacks, due to different classification rates obtained. This is due to attacks representations in the train set and dependency between features used to detect them. It will also be shown that a basic and simple classifier such as Naive Bayes has better classification results in the case of low-represented attacks, and the basic decision trees such as Naive-Bayes Tree and Best-First Tree give very good results compared to well-known J48 (Weka implementation of C4.5) and Random Forest decision trees. Based on these experiments and their results, Naive Bayes and Best-First tree classifiers were selected to classify the anomaly-detected traffic. It was shown that in the detection phase, 90% of anomalies were detected, and in the classification phase, 88% of false positives were successfully labeled as normal traffic connections, and 79% of DoS and Probe attacks were labeled correctly, mostly by NB, NBTree, and BFTree classifiers.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.018
      Issue No: Vol. 24 (2017)
  • Electronic institutions and neural computing providing law-compliance
           privacy for trusting agents
    • Authors: Mar Lopez; Javier Carbo; Jose M. Molina; Juanita Pedraza
      Pages: 119 - 131
      Abstract: Publication date: November 2017
      Source:Journal of Applied Logic, Volume 24, Part A
      Author(s): Mar Lopez, Javier Carbo, Jose M. Molina, Juanita Pedraza
      In this paper we present an integral solution for law-compliance privacy-protection into trust models for agent systems. Several privacy issues are concerned into trust relationships. Specifically, we define which privacy rights must legally be guaranteed in trusting communities of agents. From them, we describe additional interaction protocols that are required to implement such guarantees. Next, we apply additional message exchanges into a specific application domain (the Agent Trust and Reputation testbed) using JADE agent platform. The decisions about how to apply these control mechanisms (about when to launch the corresponding JADE protocol) has been efficiently carried out by neural computing. It uses past behavior of agents to decide (classify) which agents are worthy to share privacy with, considering which number of past interactions we should take into account. Furthermore, we also enumerate the corresponding privacy violations that would have taken place if these control mechanisms (in form of interaction protocols) were ignored or misused. From the possible existence of privacy violations, a regulatory structure is required to address (prevent and fix) the corresponding harmful consequences. We use Islander (an electronic institution editor) to formally define the scenes where privacy violation may be produced, attached to the ways to repair it: the defeasible actions that could voluntarily reduce or eliminate the privacy damage, and the obligations that the electronic institution would impose as penalties.

      PubDate: 2017-09-26T17:05:31Z
      DOI: 10.1016/j.jal.2016.11.019
      Issue No: Vol. 24 (2017)
  • Structure features for SAT instances classification
    • Authors: Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy
      Pages: 27 - 39
      Abstract: Publication date: September 2017
      Source:Journal of Applied Logic, Volume 23
      Author(s): Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
      The success of portfolio approaches in SAT solving relies on the observation that different SAT solvers may dramatically change their performance depending on the class of SAT instances they are trying to solve. In these approaches, a set of features of the problem is used to build a prediction model, which classifies instances into classes, and computes the fastest algorithm to solve each of them. Therefore, the set of features used to build these classifiers plays a crucial role. Traditionally, portfolio SAT solvers include features about the structure of the problem and its hardness. Recently, there have been some attempts to better characterize the structure of industrial SAT instances. In this paper, we use some structure features of industrial SAT instances to build some classifiers of industrial SAT families of instances. Namely, they are the scale-free structure, the community structure and the self-similar structure. First, we measure the effectiveness of these classifiers by comparing them to other sets of SAT features commonly used in portfolio SAT solving approaches. Then, we evaluate the performance of this set of structure features when used in a real portfolio SAT solver. Finally, we analyze the relevance of these features on the analyzed classifiers.

      PubDate: 2017-07-23T04:35:40Z
      DOI: 10.1016/j.jal.2016.11.004
      Issue No: Vol. 23 (2017)
  • Modeling group assessments by means of hesitant fuzzy linguistic term sets
    • Authors: Jordi Montserrat-Adell; Núria Agell; Mónica Sánchez; Francesc Prats; Francisco Javier Ruiz
      Pages: 40 - 50
      Abstract: Publication date: September 2017
      Source:Journal of Applied Logic, Volume 23
      Author(s): Jordi Montserrat-Adell, Núria Agell, Mónica Sánchez, Francesc Prats, Francisco Javier Ruiz
      Hesitant linguistic term sets have been introduced to capture the human way of reasoning using linguistic expressions involving different levels of precision. In this paper, a lattice structure is provided to the set of hesitant fuzzy linguistic term sets by means of the operations intersection and connected union. In addition, in a group decision making framework, hesitant fuzzy linguistic descriptions are defined to manage situations in which decision makers are assessing different alternatives by means of hesitant fuzzy linguistic term sets. Based on the introduced lattice structure, two distances between hesitant fuzzy linguistic descriptions are defined. These metric structures allow distances between decision makers to be computed. A centroid of the decision making group is proposed for each distance to model group representatives in the considered group decision making framework.

      PubDate: 2017-07-23T04:35:40Z
      DOI: 10.1016/j.jal.2016.11.005
      Issue No: Vol. 23 (2017)
  • A reward-based approach for preference modeling: A case study
    • Authors: Eva Armengol; Josep Puyol-Gruart
      Pages: 51 - 69
      Abstract: Publication date: September 2017
      Source:Journal of Applied Logic, Volume 23
      Author(s): Eva Armengol, Josep Puyol-Gruart
      Most of reasoning for decision making in daily life is based on preferences. As other kinds of reasoning processes, there are many formalisms trying to capture preferences, however none of them is able to capture all the subtleties of the human reasoning. In this paper we analyze how to formalize the preferences expressed by humans and how to reason with them to produce rankings. Particularly, we show that qualitative preferences are best represented with a combination of reward logics and conditional logics. We propose a new algorithm based on ideas of similarity between objects commonly used in case-based reasoning. We see that the new approach produces rankings close to the ones expressed by users.

      PubDate: 2017-07-23T04:35:40Z
      DOI: 10.1016/j.jal.2016.11.006
      Issue No: Vol. 23 (2017)
  • A study on anomaly detection ensembles
    • Authors: Alvin Chiang; Esther David; Yuh-Jye Lee; Guy Leshem; Yi-Ren Yeh
      Pages: 1 - 13
      Abstract: Publication date: May 2017
      Source:Journal of Applied Logic, Volume 21
      Author(s): Alvin Chiang, Esther David, Yuh-Jye Lee, Guy Leshem, Yi-Ren Yeh
      An anomaly, or outlier, is an object exhibiting differences that suggest it belongs to an as-yet undefined class or category. Early detection of anomalies often proves of great importance because they may correspond to events such as fraud, spam, or device malfunctions. By automating the creation of a ranking or list of deviations, we can save time and decrease the cognitive overload of the individuals or groups responsible for responding to such events. Over the years many anomaly and outlier metrics have been developed. In this paper we propose a clustering-based score ensembling method for outlier detection. Using benchmark datasets we evaluate quantitatively the robustness and accuracy of different ensemble strategies. We find that ensembling strategies offer only limited value for increasing overall performance, but provide robustness by negating the influence of severely underperforming models.

      PubDate: 2017-01-06T20:04:38Z
      DOI: 10.1016/j.jal.2016.12.002
      Issue No: Vol. 21 (2017)
  • On harmony and permuting conversions
    • Authors: Nissim Francez
      Pages: 14 - 23
      Abstract: Publication date: May 2017
      Source:Journal of Applied Logic, Volume 21
      Author(s): Nissim Francez
      The paper exposes the relevance of permuting conversions (in natural-deduction systems) to the role of such systems in the theory of meaning known as proof-theoretic semantics, by relating permuting conversion to harmony, hitherto related to normalisation only. This is achieved by showing the connection of permuting conversion to the general notion of canonicity, once applied to arbitrary derivations from open assumption. In the course of exposing the relationship of permuting conversions to harmony, a general definition of the former is proposed, generalising the specific cases of disjunction and existential quantifiers considered in the literature.

      PubDate: 2017-01-06T20:04:38Z
      DOI: 10.1016/j.jal.2016.12.004
      Issue No: Vol. 21 (2017)
  • Fuzzy microaggregation for the transparency principle
    • Authors: Torra
      Abstract: Publication date: September 2017
      Source:Journal of Applied Logic, Volume 23
      Author(s): Vicenç Torra
      Microaggregation has been proven to be an effective method for data protection in the areas of Privacy Preserving Data Mining (PPDM) and Statistical Disclosure Control (SDC). This method consists of applying a clustering method to the data set to be protected, and then replacing each of the data by the cluster representative. In this paper we propose a new method for microaggregation based on fuzzy clustering. This new approach has been defined with the main goal of being nondeterministic on the assignment of cluster centers to the original data, and at the same time being simple in its definition. Being nondeterministic permits us to overcome some of the attacks standard microaggregation suffers.

      PubDate: 2017-07-23T04:35:40Z
  • The never-ending recursion
    • Authors: Sergio Mota
      Abstract: Publication date: Available online 14 March 2017
      Source:Journal of Applied Logic
      Author(s): Sergio Mota
      This paper is devoted to three main aims: (I) to present the conceptual relations between recursion, on the one hand, and inductive definitions and mathematical induction, on the other; as well as among recursion and self-involvement. In order to receive the original and primary use of recursion in cognitive science, it is important to bear in mind the conceptual relations and distinctions between them. (II) To analyze the interpretation of recursion from two different approaches. The first one, mainly represented by Chomsky, emphasizes the origin of recursion in the formal sciences, and applies it to characterize the mechanical procedure which underlies the language faculty. On this view, recursion is a property of the mind/brain. The second one disregards this conception of recursion and redefines it in terms of either the processing of self-embedded structures (e.g. [20]) or the ability to represent multiple hierarchical levels using the same rule (e.g. [45]); or as follows: recursion refers to the ability to embed structures within structures of the same kind (e.g. [48]). (III) To discuss whether or not this change in the meaning of recursion is more suitable than the original one for empirical research.

      PubDate: 2017-03-20T15:22:53Z
      DOI: 10.1016/j.jal.2017.03.003
  • Formal analysis of SEU mitigation for early dependability and
           performability analysis of FPGA-based space applications
    • Authors: Khaza Anuarul Hoque; Otmane Ait Mohamed; Yvon Savaria
      Abstract: Publication date: Available online 4 March 2017
      Source:Journal of Applied Logic
      Author(s): Khaza Anuarul Hoque, Otmane Ait Mohamed, Yvon Savaria
      SRAM-based FPGAs are increasingly popular in the aerospace industry due to their field programmability and low cost. However, they suffer from cosmic radiation induced Single Event Upsets (SEUs). In safety-critical applications, the dependability of the design is a prime concern since failures may have catastrophic consequences. An early analysis of the relationship between dependability metrics, performability-area trade-off, and different mitigation techniques for such applications can reduce the design effort while increasing the design confidence. This paper introduces a novel methodology based on probabilistic model checking, for the analysis of the reliability, availability, safety and performance-area tradeoffs of safety-critical systems for early design decisions. Starting from the high-level description of a system, a Markov reward model is constructed from the Control Data Flow Graph (CDFG) and a component characterization library targeting FPGAs. The proposed model and exhaustive analysis capture all the failure states (based on the fault detection coverage) and repairs possible in the system. We present quantitative results based on an FIR filter circuit to illustrate the applicability of the proposed approach and to demonstrate that a wide range of useful dependability and performability properties can be analyzed using the proposed methodology. The modeling results show the relationship between different mitigation techniques and fault detection coverage, exposing their direct impact on the design for early decisions.

      PubDate: 2017-03-20T15:22:53Z
      DOI: 10.1016/j.jal.2017.03.001
  • On the Complexity of Input/Output Logic
    • Authors: Xin Sun; Livio Robaldo
      Abstract: Publication date: Available online 4 March 2017
      Source:Journal of Applied Logic
      Author(s): Xin Sun, Livio Robaldo
      Input/output logic is a formalism in deontic logic and normative reasoning. Unlike deontic logical frameworks based on possible-world semantics, input/output logic adopts norm-based semantics in the sense of [13], specifically operational semantics. It is well-known in theoretical computer science that complexity is an indispensable component of every logic. So far, previous literature in input/output systems focuses on proof theory and semantics, while neglects complexity. This paper adds the missing component by giving the complexity results of main decision problems in input/output logic. Our results show that input/output logic is coNP hard and in the 2nd level of the polynomial hierarchy.

      PubDate: 2017-03-20T15:22:53Z
      DOI: 10.1016/j.jal.2017.03.002
  • Rewrite Rules for CTL*
    • Authors: John C. McCabe-Dansted; Mark Reynolds
      Abstract: Publication date: Available online 23 December 2016
      Source:Journal of Applied Logic
      Author(s): John C. MCabe-Dansted, Mark Reynolds
      A number of procedures for checking the satisfiability of formulas in the important branching time temporal logic CTL* have recently been proposed. In this paper we develop techniques to support such reasoning based on rewrite rules. We consider how to automatically generate and quickly validate such rewrites. The techniques are based on use of so-called non-local and bundled variants of computation tree logics. We show that such rules can quickly simplify CTL* formulas. These simplified formulas are shorter and easier to reason with using existing decision procedures for CTL*, as demonstrated by significant speed-ups across a wide range of benchmark formulas. In this paper we provide both an Associative Commutative sound, confluent and terminating term rewrite system as well as a simple greedy rewrite system. We test them on a useful set of benchmarks. There are practical applications for theorem-proving and model-checking.

      PubDate: 2017-01-06T20:04:38Z
      DOI: 10.1016/j.jal.2016.12.003
  • Epistemic protocols for dynamic gossip
    • Authors: Hans van Ditmarsch; Jan van Eijck; Pere Pardo; Rahim Ramezanian; François Schwarzentruber
      Abstract: Publication date: Available online 5 December 2016
      Source:Journal of Applied Logic
      Author(s): Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, François Schwarzentruber
      A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.12.001
  • On expressive power of basic modal intuitionistic logic as a fragment of
           classical FOL
    • Authors: Grigory K. Olkhovikov
      Abstract: Publication date: Available online 24 November 2016
      Source:Journal of Applied Logic
      Author(s): Grigory K. Olkhovikov
      The modal characterization theorem by J. van Benthem characterizes classical modal logic as the bisimulation invariant fragment of first-order logic. In this paper, we prove a similar characterization theorem for intuitionistic modal logic. For this purpose we introduce the notion of modal asimulation as an analogue of bisimulations. The paper treats four different fragments of first-order logic induced by their respective versions of Kripke-style semantics for modal intuitionistic logic. It is shown further that this characterization can be easily carried over to arbitrary first-order definable subclasses of classical first-order models.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.11.036
  • Price of privacy
    • Authors: Pavel Naumov; Jia Tao
      Abstract: Publication date: Available online 24 November 2016
      Source:Journal of Applied Logic
      Author(s): Pavel Naumov, Jia Tao
      The article proposes a logical framework for reasoning about agents' ability to protect their privacy by hiding certain information from a privacy intruder. It is assumed that the knowledge of the intruder is derived from the observation of pieces of evidence and that there is a cost associated with the elimination of the evidence. The logical framework contains a modal operator labeled by a group of agents and a total budget available to this group. The key contribution of this work is the proposed incorporation of the cost factor into privacy protection reasoning within the standard modal logic framework. The main technical result are the soundness and completeness theorems for the introduced logical system with respect to a formally defined semantics.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.11.035
  • What kind of independence do we need for multiple iterated belief
    • Authors: Gabriele Kern-Isberner; Daniela Huvermann
      Abstract: Publication date: Available online 21 November 2016
      Source:Journal of Applied Logic
      Author(s): G. Kern-Isberner, D. Huvermann
      Multiple iterated revision requires advanced belief revision techniques that are able to integrate several pieces of new information into epistemic states. A crucial feature of this kind of revision is that the multiple pieces of information should be dealt with separately. Previous works have proposed several independence postulates which should ensure this. In this paper, we argue, first, that these postulates are too strong as they may enforce beliefs without justification, and second, that they are not necessary to ensure the principal aim of multiple revision. Instead, principles of conditional preservation guarantee a suitable handling of sets of sentences under revision. We formalize such a principle for multiple propositional revision for ranking functions, and we propose some novel postulates for multiple iterated revision that are in line with AGM and the Darwiche & Pearl postulates. We show that just a few fundamental postulates are enough to cover major approaches to (multiple) iterated belief revision, and that independence in the sense of Thielscher, Jin, and Delgrande is optional. As a proof of concept, we present propositional c-revisions of ranking functions.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.11.033
  • Efficient incremental planning and learning with multi-valued decision
    • Authors: Jean-Christophe Magnan; Pierre-Henri Wuillemin
      Abstract: Publication date: Available online 17 November 2016
      Source:Journal of Applied Logic
      Author(s): Jean-Christophe Magnan, Pierre-Henri Wuillemin
      In the domain of decision theoretic planning, the factored framework (Factored Markov Decision Process, fmdp) has produced optimized algorithms using structured representations such as Decision Trees (Structured Value Iteration (svi), Structured Policy Iteration (spi)) or Algebraic Decision Diagrams (Stochastic Planning Using Decision Diagrams (spudd)). Since it may be difficult to elaborate the factored models used by these algorithms, the architecture sdyna, which combines learning and planning algorithms using structured representations, was introduced. However, the state-of-the-art algorithms for incremental learning, for structured decision theoretic planning or for reinforcement learning require the problem to be specified only with binary variables and/or use data structures that can be improved in term of compactness. In this paper, we propose to use Multi-Valued Decision Diagrams (mdds) as a more efficient data structure for the sdyna architecture and describe a planning algorithm and an incremental learning algorithm dedicated to this new structured representation. For both planning and learning algorithms, we experimentally show that they allow significant improvements in time, in compactness of the computed policy and of the learned model. We then analyzed the combination of these two algorithms in an efficient sdyna instance for simultaneous learning and planning using mdds.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.11.032
  • Marketing impact on diffusion in social networks
    • Authors: Pavel Naumov; Jia Tao
      Abstract: Publication date: Available online 16 November 2016
      Source:Journal of Applied Logic
      Author(s): Pavel Naumov, Jia Tao
      The article proposes a way to add marketing into the standard threshold model of social networks. Within this framework, the article studies logical properties of the influence relation between sets of agents in social networks. Two different forms of this relation are considered: one for promotional marketing and the other for preventive marketing. In each case a sound and complete logical system describing properties of the influence relation is proposed. Both systems could be viewed as extensions of Armstrong's axioms of functional dependency from the database theory.

      PubDate: 2016-12-06T13:36:07Z
      DOI: 10.1016/j.jal.2016.11.034
  • Algebraic model counting
    • Authors: Angelika Kimmig; Guy Van den Broeck; Luc De Raedt
      Abstract: Publication date: Available online 15 November 2016
      Source:Journal of Applied Logic
      Author(s): Angelika Kimmig, Guy Van den Broeck, Luc De Raedt
      Weighted model counting (WMC) is a well-known inference task on knowledge bases, and the basis for some of the most efficient techniques for probabilistic inference in graphical models. We introduce algebraic model counting (AMC), a generalization of WMC to a semiring structure that provides a unified view on a range of tasks and existing results. We show that AMC generalizes many well-known tasks in a variety of domains such as probabilistic inference, soft constraints and network and database analysis. Furthermore, we investigate AMC from a knowledge compilation perspective and show that all AMC tasks can be evaluated using sd-DNNF circuits, which are strictly more succinct, and thus more efficient to evaluate, than direct representations of sets of models. We identify further characteristics of AMC instances that allow for evaluation on even more succinct circuits.

      PubDate: 2016-11-16T05:23:43Z
      DOI: 10.1016/j.jal.2016.11.031
  • Factored performance functions and decision making in continuous time
           Bayesian networks
    • Authors: Liessman Sturlaugson; Logan Perreault; John W. Sheppard
      Abstract: Publication date: Available online 15 November 2016
      Source:Journal of Applied Logic
      Author(s): Liessman Sturlaugson, Logan Perreault, John W. Sheppard
      The continuous time Bayesian network (CTBN) is a probabilistic graphical model that enables reasoning about complex, interdependent, and continuous-time subsystems. The model uses nodes to denote subsystems and arcs to denote conditional dependence. This dependence manifests in how the dynamics of a subsystem changes based on the current states of its parents in the network. While the original CTBN definition allows users to specify the dynamics of how the system evolves, users might also want to place value expressions over the dynamics of the model in the form of performance functions. We formalize these performance functions for the CTBN and show how they can be factored in the same way as the network, allowing what we argue is a more intuitive and explicit representation. For cases in which a performance function must involve multiple nodes, we show how to augment the structure of the CTBN to account for the performance interaction while maintaining the factorization of a single performance function for each node. We introduce the notion of optimization for CTBNs, and show how a family of performance functions can be used as the evaluation criteria for a multi-objective optimization procedure.

      PubDate: 2016-11-16T05:23:43Z
      DOI: 10.1016/j.jal.2016.11.030
  • Hierarchical beam search for solving most relevant explanation in Bayesian
    • Authors: Xiaoyuan Zhu; Changhe Yuan
      Abstract: Publication date: Available online 15 November 2016
      Source:Journal of Applied Logic
      Author(s): Xiaoyuan Zhu, Changhe Yuan
      Most Relevant Explanation (MRE) is an inference problem in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence. It has been shown in recent literature that it addresses the overspecification problem of existing methods, such as MPE and MAP. In this paper, we propose a novel hierarchical beam search algorithm for solving MRE. The main idea is to use a second-level beam to limit the number of successors generated by the same parent so as to limit the similarity between the solutions in the first-level beam and result in a more diversified population. Three pruning criteria are also introduced to achieve further diversity. Empirical results show that the new algorithm outperforms local search and regular beam search.

      PubDate: 2016-11-16T05:23:43Z
      DOI: 10.1016/j.jal.2016.11.028
  • An ordered credibility contrast semantics for finite probability agreement
    • Authors: Paul Snow
      Abstract: Publication date: Available online 15 November 2016
      Source:Journal of Applied Logic
      Author(s): Paul Snow
      De Finetti's 1949 ordinal probability conjecture sparked enduring interest in intuitively meaningful necessary and sufficient conditions for orderings of finite propositional domains to agree with probability distributions. This paper motivates probabilistic ordering from subjective estimates of credibility contrasts revealed when ordered propositions are not monotonically related (e.g., A or B > C or D, but D > B ) and when a portfolio of prospects is accepted as preferable to alternatives despite not dominating them. The estimated contrast primitive offers a gambling-free, psychologically grounded foundation for treating individual instances and multisets of propositions as credally interchangeable with disjunctions and multisets of their constituent atomic propositions.

      PubDate: 2016-11-16T05:23:43Z
      DOI: 10.1016/j.jal.2016.11.029
  • Editorial
    • Authors: Souhila Kaci; Robert Mercer; Matthias Thimm
      Abstract: Publication date: Available online 14 November 2016
      Source:Journal of Applied Logic
      Author(s): Souhila Kaci, Robert Mercer, Matthias Thimm

      PubDate: 2016-11-16T05:23:43Z
      DOI: 10.1016/j.jal.2016.11.027
  • On the existence of free models in fuzzy universal Horn classes
    • Authors: Vicent Costa; Pilar Dellunde
      Abstract: Publication date: Available online 10 November 2016
      Source:Journal of Applied Logic
      Author(s): Vicent Costa, Pilar Dellunde
      This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on some relevant notions in logic programming. We introduce the notion of term structure associated to a set of formulas in the fuzzy context and we show the existence of free models in fuzzy universal Horn classes. We prove that every equality-free consistent universal Horn fuzzy theory has a Herbrand model.

      PubDate: 2016-11-10T04:37:59Z
      DOI: 10.1016/j.jal.2016.11.002
  • Characterisation of unidimensional averaged similarities
    • Authors: D. Boixader; J. Recasens
      Abstract: Publication date: Available online 9 November 2016
      Source:Journal of Applied Logic
      Author(s): D. Boixader, J. Recasens
      A T-indistinguishability operator (or fuzzy similarity relation) E is called unidimensional when it may be obtained from one single fuzzy subset (or fuzzy criterion). In this paper, we study when a T-indistinguishability operator that has been obtained as an average of many unidimensional ones is unidimensional too. In this case, the single fuzzy subset used to generate E is explicitly obtained as the quasi-arithmetic mean of all the fuzzy criteria primarily involved in the construction of E.

      PubDate: 2016-11-10T04:37:59Z
      DOI: 10.1016/j.jal.2016.11.003
  • Logical Methods in Artificial Intelligence Aplications
    • Authors: Eva Armengol; Dionís Boixader; Francisco Grimaldo
      Abstract: Publication date: Available online 9 November 2016
      Source:Journal of Applied Logic
      Author(s): Eva Armengol, Dionís Boixader, Francisco Grimaldo

      PubDate: 2016-11-10T04:37:59Z
      DOI: 10.1016/j.jal.2016.11.001
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016