作者：
Lucas, Salvador
Universitat Politècnica de València Spain
The semantics of computational systems (e.g., relational and knowledge data bases, query-answering systems, programming languages, etc.) can often be expressed as (the specification of) a logical theory Th. Queries, g...
详细信息
In explainable planning, the planning agent needs to explain its plan to a human user, especially when the plan appears infeasible or suboptimal for the user. A popular approach is called model reconciliation, where t...
详细信息
The manipulation of flexible object is of primary importance in industry 4.0 and in home environments scenarios. Traditionally, this problem has been tackled by developing ad-hoc approaches, that lack of flexibility a...
详细信息
Nowadays, our lives are surrounded by various information, where large pieces of information are uncertain even inconsistent. And in user-oriented applications, users’ preferences should also be taken into account. T...
详细信息
The term Participatory Guarantee Systems (PGS) refers to quality certification systems based on the active participation of stakeholders, i.e., producers, consumers, and experts. Unlike to the more common Third Party ...
详细信息
The experiences and feelings in a first phase of transition from undergraduate to graduate courses may lead to some kind of anxiety, depression, malaise or loneliness that are not easily overwhelmed, no doubt the educ...
详细信息
ISBN:
(数字)9783030623623
ISBN:
(纸本)9783030623616;9783030623623
The experiences and feelings in a first phase of transition from undergraduate to graduate courses may lead to some kind of anxiety, depression, malaise or loneliness that are not easily overwhelmed, no doubt the educational character of each one comes into play, since the involvement of each student in academic practice depends on his/her openness to the world. In this study it will be analyzed and evaluated the relationships between academic experiences and the correspondent anxiety levels. Indeed, it is important not only a diagnose and evaluation of the students' needs for pedagogical and educational reorientation, but also an identification of what knowledge and attitudes subsist at different stages of their academic experience. The system envisaged stands for a Hybrid Artificial Intelligence Agency that integrates the phases of data gathering, processing and results' analysis. It intends to uncover the students' states of Adaptation, Anxiety and Anxiety Trait in terms of an evaluation of their entropic states, according to the 2nd Law of Thermodynamics, i.e., that energy cannot be created or destroyed;the total quantity of energy in the universe stays the same. The logic procedures are based on a logic programming approach to Knowledge Representation and Reasoning complemented with an Artificial Neural Network approach to computing.
The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set programming (ASP), and Constraint ASP...
详细信息
In this paper we consider a logical treatment for the ordered disjunction operator × introduced by Brewka, Niemelä and Syrjänen in their logic Programs with Ordered Disjunctions (LPOD). LPODs are used t...
详细信息
In this paper, we discuss the copy complexity of unit resolution with respect to Horn formulas. A Horn formula is a boolean formula in conjunctive normal form (CNF) with at most one positive literal per clause. Horn f...
详细信息
ISBN:
(纸本)9783030648428
In this paper, we discuss the copy complexity of unit resolution with respect to Horn formulas. A Horn formula is a boolean formula in conjunctive normal form (CNF) with at most one positive literal per clause. Horn formulas find applications in a number of domains such as program verification and logic programming. Resolution as a proof system for boolean formulas is both sound and complete. However, resolution is considered an inefficient proof system when compared to other stronger proof systems for boolean formulas. Despite this inefficiency, the simple nature of resolution makes it an integral part of several theorem provers. Unit resolution is a restricted form of resolution in which each resolution step needs to use a clause with only one literal (unit literal clause). While not complete for general CNF formulas, unit resolution is complete for Horn formulas. A read-once resolution (ROR) refutation is a refutation in which each clause (input or derived) may be used at most once in the derivation of a refutation. As with unit resolution, ROR refutation is incomplete in general and complete for Horn clauses. This paper focuses on a combination of unit resolution and read-once resolution called Unit read-once resolution (UROR). UROR is incomplete for Horn clauses. In this paper, we study the copy complexity problem in Horn formulas under UROR. Briefly, the copy complexity of a formula under UROR is the smallest number k such that replicating each clause k times guarantees the existence of a UROR refutation. This paper focuses on two problems related to the copy complexity of unit resolution. We first relate the copy complexity of unit resolution for Horn formulas to the copy complexity of the addition rule in the corresponding Horn constraint system. We also examine a form of copy complexity where we permit replication of derived clauses, in addition to the input clauses. Finally, we provide a polynomial time algorithm for the problem of checking if a 2-CNF form
Despite the emergence of probabilistic logic programming (PLP) languages for data driven applications, there are currently no debugging tools based on provenance for PLP programs. In this paper, we propose a novel pro...
详细信息
暂无评论