Seyed Ahmad Mirsanei

In this paper, we continued the preparatory works of Jingde Cheng in conjunction with spatio-temporal relevant logics, and proposed several epistemic spatio-temporal relevant logics as basic logics for Mobile Multi-Agent Systems (MMAS). To establish an inference system, important elements are: semantics and syntax appropriate to it include a language, axioms and inference rules. By proving the meta-logical properties such as soundness and consistency, completeness and decidability and etc., we have a method to test the reliability of the systems. Finally, we will have models and algorithms for the application of these logics in the MMAS.

Spiritual Intelligence (S-Intelligence) introduced to achieve higher levels of knowledge and applying hidden knowledge. This intelligence is various in different people. When people work together in a team or set, these diverse influence on their performance. Facilitate the application of spiritual capacities by using abilities of S- intelligence is important to increase productivity teamwork. For this purpose, we provided a model of communication for individuals with different S-intelligence in performing team tasks. First, with the basics S-intelligence analysis and interviews with experts, S-intelligence was divided in five categories. Each person according to their S-Intelligence and the role that play in teamwork (individualist, thinkist and pragmatist) from this aspect that he/she can by what kind of S-intelligences and what kind of role, has an effective team relationship, has been measured. With the 690 questionnaires …

The logical formalism of abductive reasoning is still an open discussion and various theories have been presented about it. Abduction is a type of non-monotonic and defeasible reasonings, and the logic containing such a reasoning is one of the types of non-nonmonotonic and defeasible logics, such as inductive logic. Abduction is a kind of natural reasoning and it is a solution to the problems having this form "the phenomenon of φ cannot be explained by the theory of Θ" and we need to search for (or to adduce) an explanation for φ. Taking α as the explanation and <Θ,φ> as the abductive problem, Θ∪{α}⊨φ is the logical format of a strong abductive reasoning. In this article, the proof theory for first-order abductive calculus is proposed based on Gentzen-type first-order proof theory. Considering its dual, i.e., the semantic tableaux, and without the need to translate the formulas, this calculation is sound and complete. After examining the structural rules of this calculus, some metalogical considerations and open problems such as consistency, completeness and undecidability of this account have been addressed.

n this paper, a non-classical axiomatic system was introduced to classify all moods of Aristotelian syllogisms, in addition to the axiom "Every a is an a" and the bilateral rules of obversion of E and O propositions. This system consists of only 2 definitions, 2 axioms, 1 rule of a premise, and moods of Barbara and Datisi. By adding first-degree propositional negation to this system, we prove that the square of opposition holds without using many of the other rules of classical logic (including double negation elimination). We then show that the Propositional Substructural Logic SLe is the best logic to study Aristotelian Syllogisms. Also, based on the IFLe square of opposition, the rules of conversation and the rules of negation are completely proved in Muzaffar's logic. For this purpose, we used the monadic first-order logic with the same standard deductive apparatus of quantifiers in classical logic, plus the axioms of "some a is an a" and "some not-a is a not-a". Finally, to show that there is no existential commitment to general terms in categorical logic, the Strong Four-Valued Relevant-classical Logic KR4 was used. With the same existential interpretation of the quantifiers and the standard translation of the quarter quantified.

Discovering the differences between the various systems of modal logics was one of the advantages of inventing Kripke semantics. One of the most obvious examples is interpreting the necessity of provability in provability logic. According to Boolos in The Logic of Provability, by discovering this logic, we can say that the understanding of new issues in the field of argument was opened. In this paper, with a formal approach and with a descriptive-analytical and comparative method, the axiomatic propositional systems of the GL, Grz, and H, and their possible world semantics based on Kripke semantics are studied, as well as the sequent calculus of GL (in Peano arithmetic) and GLS (in the standard model) were introduced. Finally, the meta-theorems of soundness, consistency, and completeness of the GL were interpreted and proved.

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, and report shortly our team’s advantages in developing and implementation of ΑBox abduction in DLs.

Selective abduction is in contrast with creative abduction as well as Inference to the Best Explanation (IBE). There are two types of selective abduction: Either hypotheses are selected among new and conjectural hypotheses without any prior knowledge ( Pierce s' selective abduction), or the selection of the best hypotheses and explanations is among a large number of possible hypotheses and explanations already known (L. Magnani's selective abduction and G. Schurz's factual abduction). According to both views, as well as an alternative view, which belongs to Dov M. Gabby and John Woods, selective abduction is different from inference to the best explanation. Schurz's factual abduction depends on all three sub-processes of inference, i.e.: colligation, observation, and judgment (c, o, and j); But Pierce's selective abduction, on the other hand, has only a third sub-process, i.e. judgment process (j), and therefore it cannot be regarded as a process of abductive epistemic inference.

Spiritual Intelligence (S-Intelligence) introduced to achieve higher levels of knowledge and applying hidden knowledge. This intelligence is various in different people. When people work together in a team or set, these diverse influence on their performance. Facilitate the application of spiritual capacities by using abilities of S- intelligence is important to increase productivity teamwork. For this purpose, we provided a model of communication for individuals with different S-intelligence in performing team tasks. First, with the basics S-intelligence analysis and interviews with experts, S-intelligence was divided in five categories. Each person according to their S-Intelligence and the role that play in teamwork (individualist, thinkist and pragmatist) from this aspect that he/she can by what kind of S-intelligences and what kind of role, has an effective team relationship, has been measured. With the 690 questionnaires among individuals with experience in teamwork and group communication, we have addressed to the measurement of their communication model. After derivation the data by fuzzy logic, we analyzed and presented an effective model of teamwork based on S-intelligence.

One of the main problems in t-norm fuzzy logic's meta-theorems is that despite the strong completeness of BL’s extensions such as Łukasiewicz (Ł), Gödel (G) and Product (Π) logics (i.e., Multi-valued, Gödel and Product standard algebras on [0,1] interval) in the propositional approach, in the first-order approach, given their standard chains and corresponding algebras, they aren't complete and strongly complete. One solution to this problem is that the first-order approaches of different fuzzy logics are complete and even strongly complete with respect to non-standard single chains. But despite the success of this method in proving the strong completeness of many fuzzy logics such as TM, NM, BL, SBL, Ł and their first-order extensions, G and its first-order extensions, Π and its first-order extensions, the n-contraction logics SBLn, and Every finite valued extension of BL (such as finite valued Łukasiewicz (Łn) and finite valued Gödel (Gn)), there are three open problems: (1) Are MTL, IMTL, PMTL, WNM and their first-order extensions, (strongly) complete w.r.t. a single chain? (2) Although SMTL and SBL are strongly chain complete, Are SMTL∀ and SBL∀ also strongly completeness w.r.t. a single chain? And, (3) does chain completeness entail strong chain completeness or not? Answering these open problems and proving the completeness or incompleteness of these logics is the main purpose of this study, which will be achieved by some algebraic and meta-logical strategies.