scholarly journals Equational Theorem Proving Modulo

Author(s):  
Dohan Kim ◽  
Christopher Lynch

AbstractUnlike other methods for theorem proving modulo with constrained clauses [12, 13], equational theorem proving modulo with constrained clauses along with its simplification techniques has not been well studied. We introduce a basic paramodulation calculus modulo equational theories E satisfying certain properties of E and present a new framework for equational theorem proving modulo E with constrained clauses. We propose an inference rule called Generalized E-Parallel for constrained clauses, which makes our inference system completely basic, meaning that we do not need to allow any paramodulation in the constraint part of a constrained clause for refutational completeness. We present a saturation procedure for constrained clauses based on relative reducibility and show that our inference system including our contraction rules is refutationally complete.

Author(s):  
Abubaker Elbayoudi

Aims/ objectives: To interpret the trends of Activities of Daily Living (ADL) and Activities of Daily Working (ADW) of people who are occupying Ambient Intelligence (AmI) environments and predict the next activities’ time values. This research has two main contributions; A novel proposed technique called Activity Prediction Moving Average (APMA) based on Exponentially Weighted Moving Average (EWMA) and propose a new framework to be used in our research based on the Adaptive-Network based Fuzzy Inference System (ANFIS).Study Design: Cross-sectional study.Place and Duration of Study: Department of Computer science, Institute of Science and Technology, between August 2018 and November 2018.Methodology: Three datasets are included in this research of people who are occupying smart environments. These datasets are examined using APMA and ANFIS techniques.Results: The results of the applied techniques show a good indicator of using them in human behaviour forecasting.Conclusion: we investigated prediction techniques that can be applied to the human behaviours’ data. The proposed solutions demonstrate the feasibility of interpreting this kind of data. These techniques will support the supervisor to get clear information about the situation of the participant who occupying a smart environment.


2017 ◽  
Vol 11 (1) ◽  
pp. 71 ◽  
Author(s):  
Halimahtus Mukminna ◽  
Devita Maulina Putri ◽  
Anik Nur Handayani

Tujuan artikel ini adalah membuat simulasi untuk penilaian kinerja siswa menggunakan logika fuzzy untuk mengatasi masalah proses penilaian evaluasi siswa. Disamping itu belum adanya sistem khusus yang dapat mengoptimalkan dalam memberikan dukungan bagi guru dalam melakukan evaluasi yang masih bersifat perhitungan manual. Satu cara penentuan perhitungan hasil evaluasi siswa dapat dipermudah dengan menggunakan bantuan pertimbangan Artifical Intelligence (AI) sebagai optimasinya. Dalam pertimbangan evaluasi kinerja siswa ini menggunakan logika fuzzy dengan metode inference system sugeno. Metode sugeno ini merupakan metode inference fuzzy untuk aturan yang direpresentasikan dalam bentuk IF-THEN, dimana output sistem tidak berupa himpunan fuzzy, melainkan berupa persamaan linier. Kriteria yang digunakan dalam penilaian kinerja siswa meliputi very unsuccesusful, unsuccessful, average, successful, dan very successful.  Pada simulasi ini hasil yang ditampilkan dengan perhitungan manual dan perhitungan Matlab sebagai pembandingnya hasil perhitungan secara manual nilai result 45,5 sedangkan pada perhitungan matlab nilai result sebesar 48,5. Sehingga dapat disimpulkan selisih yang disebabkan tingkat akurasi hasil inference rule pada perhitungan manual kurang efektif bahkan terkadang banyak inference rule yang harus disesuaikan.


2015 ◽  
Vol 16 (2) ◽  
pp. 163-188 ◽  
Author(s):  
AKIHISA YAMADA ◽  
SARAH WINKLER ◽  
NAO HIROKAWA ◽  
AART MIDDELDORP

AbstractEquational theories that contain axioms expressing associativity and commutativity (AC) of certain operators are ubiquitous. Theorem proving methods in such theories rely on well-founded orders that are compatible with the AC axioms. In this paper, we consider various definitions of AC-compatible Knuth-Bendix orders. The orders of Steinbach and of Korovin and Voronkov are revisited. The former is enhanced to a more powerful version, and we modify the latter to amend its lack of monotonicity on non-ground terms. We further present new complexity results. An extension reflecting the recent proposal of subterm coefficients in standard Knuth-Bendix orders is also given. The various orders are compared on problems in termination and completion.


2019 ◽  
Author(s):  
Lucas J. Hamilton ◽  
Michael T. Vale ◽  
Michelle L. Hughes ◽  
Paige M. Pasta ◽  
Katherine Judge

Sign in / Sign up

Export Citation Format

Share Document