Deontic logicprogramming (DLP) is a framework combining deontic logic and non-monotonic logicprogramming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation ...
详细信息
Knowledge Discovery consists in discovering hidden regularities in large amounts of data using data mining techniques. the obtained patterns require an interpretation that is usually achieved using some background kno...
详细信息
Knowledge Discovery consists in discovering hidden regularities in large amounts of data using data mining techniques. the obtained patterns require an interpretation that is usually achieved using some background knowledge given by experts from several domains. On the other hand, the rise of Linked Data has increased the number of connected cross-disciplinary knowledge, in the form of RDF datasets, classes and relationships. Here we show how Linked Data can be used in an inductivelogicprogramming process, where they provide background knowledge for finding hypotheses regarding the unrevealed connections between items of a cluster. By using an example with clusters of books, we show how different Linked Data sources can be used to automatically generate rules giving an underlying explanation to such clusters.
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternational C...
详细信息
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternationalconference on Principles of Knowledge Representation and Reasoning (KR'08), 411-421;2013b. Proc. of the 12thinternationalconference on logicprogramming and Nonmonotonic Reasoning (LPNMR'13), 264-276) adapted the well-known AGM framework (Alchourron et al. 1985. Journal of Symbolic logic 50, 2, 510-530) to LP revision. they identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result t
the amount and variety of data that we produce every day pose a constant challenge for meaningful information processing. While knowledge graphs have gained a considerable attention in the recent years, due to their f...
详细信息
ISBN:
(纸本)9789897584749
the amount and variety of data that we produce every day pose a constant challenge for meaningful information processing. While knowledge graphs have gained a considerable attention in the recent years, due to their flexible and universal knowledge representation, they lack the mechanisms facilitating knowledge processing. In this paper, we propose an information system called extended knowledge graphs (EKG) that augments the concept of knowledge graphs with procedural attachments. We put forward the requirements and assumption of the EKG structure and present a categorisation of supported reasoning tasks.
Capacity planning is a challenging issue for designing next generation optical core networks. this paper presents a fuzzy linear programming (FLP) approach for capacity planning in optical networks under long-term dem...
详细信息
ISBN:
(纸本)9781424477982
Capacity planning is a challenging issue for designing next generation optical core networks. this paper presents a fuzzy linear programming (FLP) approach for capacity planning in optical networks under long-term demand uncertainty where the information of traffic loads is imprecise by nature. the simplicity of fuzzy logic is integrated with linear programming for capacity planning in optical backbones. the uncertainties in demand matrix are represented by membership functions using alpha-cut concept to provide a mathematical framework for dealing with non statistical uncertainties. the proposed approach offers the ability of consideration all conditions for decision making in optical networks. Simulation results show the efficiency of fuzzy linear programming method for capacity planning in optical networks. the proposed approach could be extended for considering other uncertainty sources in capacity planning problem of optical networks such as objective function and constraints.
Graphical languages are standard in the field of computer programming. Complex software development is best handled by graphically connecting pre-built, fully tested and highly specialized software components, instead...
详细信息
ISBN:
(纸本)9781424401208
Graphical languages are standard in the field of computer programming. Complex software development is best handled by graphically connecting pre-built, fully tested and highly specialized software components, instead of writing and debugging thousands of lines of code. Modern programming environments include complete libraries of such components. In the field of Programmable logic Controllers (PLCs), this is not the case. PLC programs can be developed using graphical languages, as Ladder Diagrams (LD) or Function Block Diagrams (FBD), but the standard libraries are very limited, so the programmer must develop his own libraries, building software objects from scratch. In this paper, a framework is presented for automatically building complex software modules using based on two key pillars: on the one hand, using object oriented concepts as encapsulation, inheritance and generic programming, and, in the other one, closely following the physical model of the objects used in building electrical control cabinets (ECBs).
A key feature of ProPPR, a recent probabilistic logic language inspired by stochastic logic programs (SLPs), is its use of personalized PageRank for efficient inference. We adopt this view of probabilistic inference a...
详细信息
ISBN:
(数字)9783319237084
ISBN:
(纸本)9783319237084;9783319237077
A key feature of ProPPR, a recent probabilistic logic language inspired by stochastic logic programs (SLPs), is its use of personalized PageRank for efficient inference. We adopt this view of probabilistic inference as a random walk over a graph constructed from a labeled logic program to investigate the relationship between these two languages, showing that the differences in semantics rule out direct, generally applicable translations between them.
One of the main challenges of computing education is the teaching of computer programming. Technical skills related to algorithm logic, programming language syntax, and computational platforms are required to program....
详细信息
ISBN:
(纸本)9789897584176
One of the main challenges of computing education is the teaching of computer programming. Technical skills related to algorithm logic, programming language syntax, and computational platforms are required to program. In addition, several non-technical skills are required, enabling the student to understand and to interpret real problems, to work in groups and to strive for effective and efficient solutions. To meet these challenges, innovative teaching methodologies have been applied in teaching programming, building learning environments that are more conducive to the development of these skills. In order to understand how these methodologies are being used, this work presents the result of a systematic literature review, motivated by the following research question: "What are the innovative teaching and learning approaches to programming, how are they applied and what are the main results of their application? In this study, we considered three digital libraries and found 24 primary studies, following the Kitchenham methodology. these studies were categorized into 6 groups and highlighted challenges related to the problems addressed, teaching environment, content, human capital involved and assessment process. the studies also showed evidence of success cases, as well as open paths for new research.
In this talk, I will consider some possible extensions to existing functional programming languages that would make them more suitable for the important and growing class of artificial intelligence applications. First...
详细信息
ISBN:
(纸本)9781595938152
In this talk, I will consider some possible extensions to existing functional programming languages that would make them more suitable for the important and growing class of artificial intelligence applications. First, I will motivate the need for these language extensions. then I will give some technical detail about these extensions that provide the logicprogramming idioms, probabilistic computation, and modal computation. Some examples will be given to illustrate these ideas which have been implemented in the Bach programming language that is an extension of Haskell.
Horn clause logic is a powerful representation language exploited in logicprogramming as a computer programming framework and in inductivelogicprogramming as a formalism for expressing examples and learned theories...
详细信息
ISBN:
(纸本)9783642239533
Horn clause logic is a powerful representation language exploited in logicprogramming as a computer programming framework and in inductivelogicprogramming as a formalism for expressing examples and learned theories in domains where relations among objects must be expressed to fully capture the relevant information. While the predicates that make up the description language are defined by the knowledge engineer and handled only syntactically by the interpreters, they sometimes express information that can be properly exploited only with reference to a suitable background knowledge in order to capture unexpressed and underlying relationships among the concepts described. this is typical when the representation includes numerical information, such as single values or intervals, for which simple syntactic matching is not sufficient. this work proposes an extension of an existing framework for similarity assessment between First-Order logic Horn clauses, that is able to handle numeric information in the descriptions. the viability of the solution is demonstrated on sample problems.
暂无评论