Abstract
AbstractThis paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi∼Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what is called embedded implication, to model solving goals with respect to assumptions. We start with a propositional system and incrementally build more complex systems and implementations to satisfy the requirements imposed by a system like Bousi∼Prolog. Finally, we propose an inference system, operational semantics and the translation function to generate efficient Prolog programmes from Bousi∼Prolog programmes.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference23 articles.
1. Cuijpers, P. J. L. 2013. Prefix orders as a general model of dynamics. In 9th International Workshop on Developments in Computational Models (DCM 2013). Universidad de Buenos Aires, 25–29.
2. Julián-Iranzo, P. and Sáenz-Pérez, F. 2017. FuzzyDES or how DES met Bousi∼Prolog. In International Conference on Fuzzy Systems (FUZZ-IEEE), Naples, Italy, July 9–12. 1–6.
3. Hypothetical reasoning with intuitionistic logic;Bonner;Non-Standard Queries and Answers, Studies on Logic and Computation,1994
4. SWI-Prolog
5. Julián-Iranzo, P. and Sáenz-Pérez, F. 2021. Proximity-based Unification: an Efficient Implementation Method. IEEE Transactions on Fuzzy Systems 29, 5, 1238–1251.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献