We generalize the notion of "not subject to occur-check" (NSTO), on which most known results on avoiding the occur-check in logic programming are based. NSTO means that unification is performed only on such ...
详细信息
We generalize the notion of "not subject to occur-check" (NSTO), on which most known results on avoiding the occur-check in logic programming are based. NSTO means that unification is performed only on such pairs of atoms for which the occur-check never succeeds in any run of a nondeterministic unification algorithm. Here we show that "any run" can be weakened to "some run". We present some related sufficient conditions under which the occur-check may be safely omitted. We show examples for which the proposed approach provides more general results than the approaches based on wellmoded and nicely moded programs (this includes cases to which the latter approaches are inapplicable). We additionally present a sufficient condition based on NSTO, working for arbitrary selection rules.& COPY;2023 Published by Elsevier B.V.
It is generally agreed upon that so-called strong persistence (SP) captures best the essence of forgetting in logic programming. While classes of operators, such as FR and FSP, that satisfy immediate relaxations of (S...
详细信息
Games often generate text from human-authored templates and adapt that text to relevant context. Many systems have been developed to aid this process using techniques such as context-free grammars, randomization, logi...
详细信息
If there is a format that is easy for both humans and AI (computers) to understand and infer, and also if the humans let the AI learn various morals, ethics and values in the above format, these data may be operated a...
详细信息
This paper introduces a new way to perform space syntax analyses using Prolog, a logic programming language concerned with Artificial Intelligence. Developed in the 1970’s to process natural languages, Prolog can dea...
详细信息
Over the last few years, Artificial Intelligence (AI) has pervaded our lives. As a result, automated tools that "reason" on different scenarios have become more and more common. As this trend continues to gr...
详细信息
We propose an algorithm based on satisfiability problem (SAT) solving for determining the contension inconsistency degree in propositional knowledge bases. In addition, we present a revised version of an algorithm bas...
详细信息
Answer Set programming (ASP) is a branch of logic programming particularly useful for representing complex domains. logic abduction, the reasoning strategy that deals with incomplete data, is tightly related to ASP, a...
详细信息
Procedural content generation eases and accelerates the development of video games by creating data algorithmically through a combination of human-generated assets and algorithms usually coupled with computer-generate...
详细信息
The BEWARE-22 workshop, held on December 2, 2022 in Udine, Italy, focused on emerging ethical aspects of artificial intelligence, with a particular emphasis on bias, risk, explainability, and the role of logic and log...
详细信息
暂无评论