Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in the rules and rather general connectives in the b...
详细信息
ISBN:
(纸本)3540222189
Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the need of biresiduated pairs is justified through the study of a very intuitive family of operators, which turn out to be not necessarily commutative and associative and, thus, might have two different residuated implications;finally, we introduce the framework of biresiduated multi-adjoint logic programming and sketch some considerations on its fixpoint semantics.
Inductive logic programming can be viewed as a style of statistical inference where the model that is inferred to explain the observed data happens to be a logic program. In general, logic programs have important diff...
详细信息
ISBN:
(纸本)3540229418
Inductive logic programming can be viewed as a style of statistical inference where the model that is inferred to explain the observed data happens to be a logic program. In general, logic programs have important differences to other models (such as linear models, tree-based models, etc) found in the statistical literature. This why we have ILP conferences!
This paper considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: (i) the quantity of data that can be handled contemporarily is limi...
详细信息
ISBN:
(纸本)354045764X
This paper considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: (i) the quantity of data that can be handled contemporarily is limited, due to the fact that reasoning is generally carried out in main memory;(ii) the interaction with external (and independent) DBMSs is not trivial and, in several cases, not allowed at all;(iii) the efficiency of present implementations is still not sufficient for their utilization in complex reasoning tasks involving massive amounts of data. This paper provides a contribution in this setting;it presents a new system, called DLVDB, which aims to solve all these problems.
We examine the solution to logic problems via traditional logic programming, constraint logic programming (CLP), and object-oriented CLP. logic problems are a special case of the constraint satisfaction problem (CSP);...
详细信息
ISBN:
(纸本)0780309715
We examine the solution to logic problems via traditional logic programming, constraint logic programming (CLP), and object-oriented CLP. logic problems are a special case of the constraint satisfaction problem (CSP);the task involves finding a consistent assignment of a set of unique attributes (values) to a set of unique objects (variables) given a collection of clues. The traditional Prolog approach is to generate a solution and test its correctness. Though declaratively appealing, this generate-and-test approach is procedurally inefficient due to Prolog's chronological backtracking and passive utilization of constraints. Since logic problems are inherently CSPs they are amenable to more efficient solution by CLP;this constrain-and-generate approach uses constraints actively, reducing the search-space therefore resulting in greater computational efficiency. Moreover, we argue that a more structured and readable solution results through the incorporation of objects. We illustrate the utility of object-oriented CLP as a tool for artificial intelligence programming. The paradigm provides a vehicle for efficient, declarative yet structured and reusable programming.
.Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, en...
详细信息
ISBN:
(纸本)3540206426
.Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.
A continuing problem with Inductive logic programming (ILP) [1] has been the poor handling of numbers. Constraint Inductive logic programming (CILP) aims to solve this problem. We propose a new approach to CILP, and i...
详细信息
ISBN:
(纸本)3540202560
A continuing problem with Inductive logic programming (ILP) [1] has been the poor handling of numbers. Constraint Inductive logic programming (CILP) aims to solve this problem. We propose a new approach to CILP, and implement a prototype of CILP system called BPU-CILP. In our approach, methods from pattern recognition, such as Fisher's linear discriminant [2] and prototype-based partitional clustering [3], are introduced into CILP. BPU-CILP can generate various forms of polynomial constraints in multiple dimensions, without additional background knowledge. As results, a CLP program covering all positive examples and consistent with all negative examples can be automatically derived.
Multiple-choice questions of comparing one entity with another in a university's entrance examination like Gaokao in China are very common but require high knowledge skill. As a preliminary attempt to address this...
详细信息
ISBN:
(纸本)9783319736181;9783319736174
Multiple-choice questions of comparing one entity with another in a university's entrance examination like Gaokao in China are very common but require high knowledge skill. As a preliminary attempt to address this problem, we build a geography Gaokao-oriented knowledge acquisition system for comparative sentences based on logic programming to help solve real geography examinations. Our work consists of two consecutive tasks: identify comparative sentences from geographical texts and extract comparative elements from the identified comparative sentences. Specifically, for the former task, logic programming is employed to filter out non-comparative sentences, and for the latter task, the information of dependency grammar and heuristic position is adopted to represent the relations among comparative elements. The experimental results show that our system achieves outstanding performance for practical use.
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. Exploiting higher-order terms in this ...
详细信息
ISBN:
(纸本)9780769537467
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. Exploiting higher-order terms in this metalanguage, we specify the operational semantics of a number of object language features, such as call-by-value, call-by-name, call-by-need, mutable store, parallelism, communication, exceptions and continuations. The specifications exhibit a high degree of uniformity and modularity that allows us to analyze the structural properties required for each feature in isolation. Our substructural framework thereby provides a new methodology for language specification that synthesizes structural operational semantics, abstract machines, and logical approaches.
logic programming with strong negation (LPS) was proposed by Pearce and Wagner (1991) to handle both explicit and implicit negative information in knowledge representation in AI. We describe tableau calculi for LPS an...
详细信息
ISBN:
(纸本)3540629203
logic programming with strong negation (LPS) was proposed by Pearce and Wagner (1991) to handle both explicit and implicit negative information in knowledge representation in AI. We describe tableau calculi for LPS and establish the completeness. The proposed tableau calculi can deal with a wider class of programs in LPS. We also discuss possible refinements of the tableau calculi to improve efficiency.
In this paper we investigate how to integrate the XQuery language and logic programming. With this aim, we represent XML documents by means of a logic program. This logic program represents the document schema by mean...
详细信息
ISBN:
(纸本)9783642006746
In this paper we investigate how to integrate the XQuery language and logic programming. With this aim, we represent XML documents by means of a logic program. This logic program represents the document schema by means of rules and the document itself by means of facts. Now, XQuery expressions can be integrated into logic programming by considering a translation (i.e. encoding) of for-let-where-return expressions by means of logic rules and a goal.
暂无评论