This paper presents four novel approaches to enhance efficiency and effectiveness of Inductive logic programming (ILP) systems, along with their implementation in a new ILP system, called TWEETY. The proposed approach...
详细信息
This paper presents four novel approaches to enhance efficiency and effectiveness of Inductive logic programming (ILP) systems, along with their implementation in a new ILP system, called TWEETY. The proposed approaches include (1) a new declaration mechanism, called connection declarations, for bottom clause construction, which is simpler but more expressive than the commonly used mode declarations;(2) a new covering technique, called super_covering, which reduces the examples in such a way that recursion can be learned, independently from the ordering of the examples;(3) a new search heuristics, called neg_coverage heuristics, which guides the search using only the number of negative examples covered by each hypothesis and (4) a new search algorithm, called doubly_guided_search, which searches for best clauses by alternating the use of two search heuristics, i.e. the traditional coverage search heuristics and the new neg_coverage search heuristics. The TWEETY system is shown to be more effective and efficient than the state-of-the-art ILP system ALEPH;the proposed techniques can be used to enhance efficiency and effectiveness of ALEPH and other systems based on the same ILP principles.
The 30th edition of the International Conference of logic programming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiati...
详细信息
The 30th edition of the International Conference of logic programming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiative in 2010 taken by the Association for logic programming and Cambridge University Press, the full papers accepted for the International Conference on logic programming again appear as a special issue of Theory and Practice of logic programming (TPLP) - the 30th International Conference on logic programming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logic programming including but not restricted to: Theory: Semantic Foundations, Formalisms, Non- monotonic Reasoning, Knowledge Representation; Implementation: Compilation, Memory Management, Virtual Machines, Parallelism; Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing; Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, programming Techniques; Related Paradigms: Abductive logic programming, Inductive logic programming, Constraint logic programming, Answer-Set programming; Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics.
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and no...
详细信息
The AGM postulates are for the belief revision (revision by a single belief), and the DP postulates are for the iterated revision (revision by a finite sequence of beliefs). Li (The Computer Journal 50:378–390, 2007)...
详细信息
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we...
详细信息
The online answer set solver oClingo offers a powerful new technique for uniting the speed of Answer Set programming (ASP) with dynamic events. The price of this power is paid by increased constraints on the construct...
详细信息
A debate game provides an abstract model of debates between two players based on the formal argumentation framework. This paper presents a method of realizing debate games in logic programming. Two players have their ...
详细信息
ISBN:
(数字)9783319089096
ISBN:
(纸本)9783319089096;9783319089089
A debate game provides an abstract model of debates between two players based on the formal argumentation framework. This paper presents a method of realizing debate games in logic programming. Two players have their knowledge bases represented by extended logic programs, and build claims using arguments associated with those programs. A player updates its knowledge base with arguments posed by the opponent player, and tries to refute claims by the opponent. During a debate game, a player may claim false or incorrect arguments as a tactic to win the game. The result of this paper provides a new formulation of debate games in a non-abstract argumentation framework associated with logic programming. Moreover, it provides a novel application of logic programming to modelling social debates which involve argumentative reasoning, belief update and dishonest reasoning.
logic programming (LP) is an essential part of many academic curricula and it is extensively employed in the field of Artificial Intelligence. However, being based on a fundamentally different paradigm and lacking any...
详细信息
ISBN:
(纸本)9781479940387
logic programming (LP) is an essential part of many academic curricula and it is extensively employed in the field of Artificial Intelligence. However, being based on a fundamentally different paradigm and lacking any visual tools for inexperienced users, its teaching may lead to confusion and low student motivation. Virtual Worlds (VWs) may help overcome these obstacles, as they have been successfully used in computer programming education. In this paper we present the MeLoISE platform (Meaningful logical Interpretations of Simulated Environments) for teaching LP in VWs, through which students can experience a collaborative visual interface to the Prolog programming language. We also present an evaluation of MeLoISE, which was conducted during a learning activity that engaged students in collaborative programming for 2 problem scenarios. Students performed very well and were enthusiastic with the new environment.
Tau Prolog is a client-side Prolog interpreter fully implemented in JavaScript, which aims at implementing the ISO Prolog Standard. Tau Prolog has been developed to be used with either *** or a browser seamlessly, and...
详细信息
Tau Prolog is a client-side Prolog interpreter fully implemented in JavaScript, which aims at implementing the ISO Prolog Standard. Tau Prolog has been developed to be used with either *** or a browser seamlessly, and therefore, it has been developed following a non-blocking, callback-based approach to avoid blocking web browsers. Taking the best from JavaScript and Prolog, Tau Prolog allows the programmer to handle browser events and manipulate the Document Object Model (DOM) of a web using Prolog predicates. In this paper we describe the architecture of Tau Prolog and its main packages for interacting with the Web, and we present its programming environment.
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radia...
详细信息
ISBN:
(纸本)9780735412415
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.
暂无评论