The Experts below are selected from a list of 49881 Experts worldwide ranked by ideXlab platform
Ryuta Arisaka - One of the best experts on this subject based on the ideXlab platform.
-
gradual Classical Logic for attributed objects extended in re presentation
arXiv: Artificial Intelligence, 2015Co-Authors: Ryuta ArisakaAbstract:Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as space, time, size, colour, etc, - in short, any reasonable quality - into which an object is subjected, it becomes infeasible to affirm atomicity in the concept referring to the object. However, formal/symbolic Logics typically presume atomic entities upon which other expressions are built. Can we reflect our intuition about the concept onto formal/symbolic Logics at all? I assure that we can, but the usual perspective about the atomicity needs inspected. In this work, I present gradual Logic which materialises the observation that we cannot tell apart whether a so-regarded atomic entity is atomic or is just atomic enough not to be considered non-atomic. The motivation is to capture certain phenomena that naturally occur around concepts with attributes, including presupposition and contraries. I present Logical particulars of the Logic, which is then mapped onto formal semantics. Two linguistically interesting semantics will be considered. Decidability is shown.
-
Gradual Classical Logic for Attributed Objects
2014Co-Authors: Ryuta ArisakaAbstract:There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and their attributes.' This work inspects tacit agreements on assumptions about the relation between objects and their attributes, and studies a way of expressing them, presenting as the result what we term gradual Logic in which the sense of truth gradually shifts. It extends Classical Logic instances with a new Logical connective capturing the object-attribute relation. A formal semantics is presented. Decidability is proved. Para- consistent/epistemic/conditional/intensional/description/combined Logics are compared.
Michel Parigot - One of the best experts on this subject based on the ideXlab platform.
-
strong normalization of second order symmetric lambda calculus
Foundations of Software Technology and Theoretical Computer Science, 2000Co-Authors: Michel ParigotAbstract:Typed symmetric λ-calculus is a simple computational interpretation of Classical Logic with an involutive negation. Its main distinguishing feature is to be a true non-confluent computational interpretation of Classical Logic. Its non-confluence reflects the computational freedom of Classical Logic (as compared to intuitionistic Logic). Barbanera and Berardi proved in [1,2] that first order typed symmetric λ-calculus enjoys the strong normalization property and showed in [3] that it can be used to derive symmetric programs. In this paper we prove strong normalization for second order typed symmetric λ-calculus.
Joost Vennekens - One of the best experts on this subject based on the ideXlab platform.
-
answer set programming s contributions to Classical Logic
2011Co-Authors: Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice BruynoogheAbstract:Much research in Logic programming and non-monotonic reasoning originates from dissatisfaction with Classical Logic as a knowledge representation language, and with Classical deduction as a mode for automated reasoning. Discarding these Classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important that they should not remain disconnected from their Classical roots. Ultimately, a clear picture should emerge of what the achievements of answer set programming mean in the context of Classical Logic, so that they may be given their proper place in the canon of science. In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of Classical Logic that they exposed and investigate how the ASP approaches can be transferred back to the Classical setting. Among the issues we thus address are the closed world assumption, “Classical” and default negation, default reasoning with exceptions, definitions, lp-functions and the interpolation technique and the strong introspection operator. We investigate the ASP-methodology to encode knowledge using these language constructs and come across a dichotomy in the ASP-methodology.
-
answer set programming s contributions to Classical Logic an analysis of asp methodology
Logic programming knowledge representation and nonmonotonic reasoning, 2011Co-Authors: Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice BruynoogheAbstract:Much research in Logic programming and non-monotonic reasoning originates from dissatisfaction with Classical Logic as a knowledge representation language, and with Classical deduction as a mode for automated reasoning. Discarding these Classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important that they should not remain disconnected from their Classical roots. Ultimately, a clear picture should emerge of what the achievements of answer set programming mean in the context of Classical Logic, so that they may be given their proper place in the canon of science. In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of Classical Logic that they exposed and investigate how the ASP approaches can be transferred back to the Classical setting. Among the issues we thus address are the closed world assumption, "Classical" and default negation, default reasoning with exceptions, definitions, lp-functions and the interpolation technique and the strong introspection operator. We investigate the ASP-methodology to encode knowledge using these language constructs and come across a dichotomy in the ASP-methodology.
-
building a knowledge base system for an integration of Logic programming and Classical Logic
International Conference on Logic Programming, 2008Co-Authors: Marc Denecker, Joost VennekensAbstract:This paper presents a Knowledge Base project for FO(ID), an extension of Classical Logic with inductive definitions. This Logic is a natural integration of Classical Logic and Logic programming based on the view of a Logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities and striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive with the best ASP-solvers.
Christian G Fermuller - One of the best experts on this subject based on the ideXlab platform.
-
cut elimination for first order godel Logic by hyperclause resolution
International Conference on Logic Programming, 2008Co-Authors: Matthias Baaz, Agata Ciabattoni, Christian G FermullerAbstract:Efficient, automated elimination of cuts is a prerequisite for proof analysis. The method CERES, based on Skolemization and resolution has been successfully developed for Classical Logic for this purpose. We generalize this method to Godel Logic, an important intermediate Logic, which is also one of the main formalizations of fuzzy Logic.
Marc Denecker - One of the best experts on this subject based on the ideXlab platform.
-
answer set programming s contributions to Classical Logic
2011Co-Authors: Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice BruynoogheAbstract:Much research in Logic programming and non-monotonic reasoning originates from dissatisfaction with Classical Logic as a knowledge representation language, and with Classical deduction as a mode for automated reasoning. Discarding these Classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important that they should not remain disconnected from their Classical roots. Ultimately, a clear picture should emerge of what the achievements of answer set programming mean in the context of Classical Logic, so that they may be given their proper place in the canon of science. In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of Classical Logic that they exposed and investigate how the ASP approaches can be transferred back to the Classical setting. Among the issues we thus address are the closed world assumption, “Classical” and default negation, default reasoning with exceptions, definitions, lp-functions and the interpolation technique and the strong introspection operator. We investigate the ASP-methodology to encode knowledge using these language constructs and come across a dichotomy in the ASP-methodology.
-
answer set programming s contributions to Classical Logic an analysis of asp methodology
Logic programming knowledge representation and nonmonotonic reasoning, 2011Co-Authors: Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice BruynoogheAbstract:Much research in Logic programming and non-monotonic reasoning originates from dissatisfaction with Classical Logic as a knowledge representation language, and with Classical deduction as a mode for automated reasoning. Discarding these Classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important that they should not remain disconnected from their Classical roots. Ultimately, a clear picture should emerge of what the achievements of answer set programming mean in the context of Classical Logic, so that they may be given their proper place in the canon of science. In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of Classical Logic that they exposed and investigate how the ASP approaches can be transferred back to the Classical setting. Among the issues we thus address are the closed world assumption, "Classical" and default negation, default reasoning with exceptions, definitions, lp-functions and the interpolation technique and the strong introspection operator. We investigate the ASP-methodology to encode knowledge using these language constructs and come across a dichotomy in the ASP-methodology.
-
building a knowledge base system for an integration of Logic programming and Classical Logic
International Conference on Logic Programming, 2008Co-Authors: Marc Denecker, Joost VennekensAbstract:This paper presents a Knowledge Base project for FO(ID), an extension of Classical Logic with inductive definitions. This Logic is a natural integration of Classical Logic and Logic programming based on the view of a Logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities and striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive with the best ASP-solvers.
