This paper presents the Connectionist Inductive Learning and logic programming System (C-(ILP)-P-2). C-(ILP)-P-2 is a new massively parallel computational model based on a feedforward Artificial Neural Network that in...
详细信息
This paper presents the Connectionist Inductive Learning and logic programming System (C-(ILP)-P-2). C-(ILP)-P-2 is a new massively parallel computational model based on a feedforward Artificial Neural Network that integrates inductive learning from examples and background knowledge, with deductive learning from logic programming. Starting with the background knowledge represented by a propositional logic program, a translation algorithm is applied generating a neural network that can be trained with examples. The results obtained with this refined network can be explained by extracting a revised logic program from it. Moreover, the neural network computes the stable model of the logic program inserted in it as background knowledge, or learned with the examples, thus functioning as a parallel system for logic programming. We have successfully applied C-(ILP)-P-2 to two real-world problems of computational biology, specifically DNA sequence analyses. Comparisons with the results obtained by some of the main neural, symbolic, and hybrid inductive learning systems, using the same domain knowledge, show the effectiveness of C-(ILP)-P-2.
The proceedings contain 33 papers. The topics discussed include: logic programming and nonmonotic reasoning: from theory to systems and applications;policy based computing: from systems and applications to theory;the ...
详细信息
ISBN:
(纸本)9783540721994
The proceedings contain 33 papers. The topics discussed include: logic programming and nonmonotic reasoning: from theory to systems and applications;policy based computing: from systems and applications to theory;the first answer set programming system competition;CR-models: an inference engine for CR-prolog;debugging ASP programs by means of ASP;conflict-driven answer set enumeration;head-elementary-set-free logic programs;a deductive system for PC(ID);modularity aspects of disjunctive stable models;a unified semantics for constraint handling rules in transaction;conditional planning with external functions;general default logic;the LP-OD system logic programming meets outlier detection;a conflict-driven answer set solver;programming applications in CIFF;an application of defeasible logic programming to decision making in a robotic environment;on the effectiveness of looking ahead in search for answer sets;and modularity in SMODELS programs.
Based on the study of the current two methods—interpretation and compilation—for the integration of logic programming and relational database,a new precompilation-based interpretive approach is *** inherits the adva...
详细信息
Based on the study of the current two methods—interpretation and compilation—for the integration of logic programming and relational database,a new precompilation-based interpretive approach is *** inherits the advantages of both methods,but overcomes the drawbacks of theirs.A new integrated system based on this approach is presented,which has been implemented on Micro VAX Ⅱ and applied to practise as the kernel of the GKBMS knowledge base management *** discussed are the key implementation techniques,including the coupling of logic and relational database systems,the compound of logic and relational database languages,the partial evaluation and static optimization of user's programs,fact scheduling and version management in problem-solving.
There is a multitude of seller-centric e-marketplaces in the Business-to-Business Electronic Commerce (B2B EC) environment. As the name implies, they are not organized from the buying organization's point of view....
详细信息
There is a multitude of seller-centric e-marketplaces in the Business-to-Business Electronic Commerce (B2B EC) environment. As the name implies, they are not organized from the buying organization's point of view. Thus, the buying organization needs to define a buyer-centric directory from the external e-marketplaces. This is particularly important in desk-top purchasing systems that use the internalized e-catalog. Recently, the one-to-one e-catalog approach is attempted to allow the buyer to select a sub-directory from a seller's directory. Although this is a helpful screening capability, there are still several problems to be resolved such as the mismatched level of details, directory depths unbalance, and changed category names. In addition, the integration with multiple sellers' e-catalogs and maintaining consistency with the dynamically changing sellers' e-catalogs should be supported. To overcome these problems, we adopt the logic programming approach because it can represent the structures of both buyers' and sellers' directories. Predicates as directory definition language can effectively represent the buyer's extraction of relevant parts from sellers' directories. The crudely selected directory can be modified using five directory modification rules. To control the application of these rules, we devised a top-down control algorithm. The algorithm could improve the depth and balance of die directory significantly, which will result in automatically generating more effective buyer's directory. (C) 2002 Elsevier Science B.V All rights reserved.
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it cove...
详细信息
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for queries with a finite number of explanations. This restriction prohibits the encoding of probabilistic model checkers, where explanations correspond to executions of the system being model checked. To overcome this restriction, we propose a more general inference algorithm that uses finite generative structures (similar to automata) to represent families of explanations. The inference algorithm computes the probability of a possibly infinite set of explanations directly from the finite generative structure. We have implemented our inference algorithm in XSB Prolog, and use this implementation to encode probabilistic model checkers for a variety of temporal logics, including PCTL and GPL (which subsumes PCTL*). Our experiment results show that, despite the highly declarative nature of their encodings, the model checkers constructed in this manner are competitive with their native implementations.
We formalized renvoi in private international law in JURIX 2019 in terms of modal logic fragment. In this demonstration paper, we show an implementation of the formalism by translating modal formula into a logic program.
ISBN:
(纸本)9781643681511;9781643681504
We formalized renvoi in private international law in JURIX 2019 in terms of modal logic fragment. In this demonstration paper, we show an implementation of the formalism by translating modal formula into a logic program.
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for well-defined problems. However, solving ill-defined problems is important because it can enhance the cog...
详细信息
ISBN:
(纸本)9783540781387
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for well-defined problems. However, solving ill-defined problems is important because it can enhance the cognitive, metacognitive and argumentation skills of a student. In this paper, we demonstrate how to apply the constraint-based modelling approach to describe the solution space of ill-defined problems in logic programming. This technology has been integrated into a web-based ITS (INCOM) and has been evaluated with student solutions from past examinations.
作者：
Hirani, A.Subrahmanian, V.S.MS 1-40
SUN Microsystems 2550 Garcia Avenue Mountain View CA 94043 USADepartment of Computer Science University of Maryland College Park MD 20742 USA
Given a logic program P, the operator TP associated with P is closely related to the intended meaning of P. Given a first order language L that is generated by finitely many non-logical symbols, our aim is to study th...
详细信息
Given a logic program P, the operator TP associated with P is closely related to the intended meaning of P. Given a first order language L that is generated by finitely many non-logical symbols, our aim is to study the algebraic properties of the set {TP|P is a general logic program in language L} with certain operators on it. For the operators defined in this paper the resulting algebraic structure is a bounded distributive lattice. Our study extends (to the case of general logic programs), the work of Mancarella and Pedreschi who initiated a study of the algebraic properties of the space of pure logic programs. We study the algebraic properties of this set and identify the ideals and zero divisors. In addition, we prove that our algebra satisfies various non-extensibility conditions.
The issue of value invention in logic programming embraces many scenarios, such as logic programming with function symbols, object oriented logic languages, inter-operability with external sources of knowledge, or set...
详细信息
The issue of value invention in logic programming embraces many scenarios, such as logic programming with function symbols, object oriented logic languages, inter-operability with external sources of knowledge, or set unification. This work introduces a framework embedding value invention in a general context. The class of programs having a suitable (but, in general, not decidable) 'finite grounding property' is identified, and the class of 'value invention restricted' programs is introduced. Value invention restricted programs have the finite grounding property and can be decided in polynomial time. They are a very large polynomially decidable class having this property, when no assumption can be made about the nature of invented values (while this latter is the case in the specific literature about logic programming with function symbols). Relationships with existing formalisms are eventually discussed, and the implementation of a system supporting the class of such programs is described.
Among the various tasks involved in SE & KE, requirements engineering, specification, prototyping, and validation are regarded as crucial since they decide whether a software system fulfills the users' expecta...
详细信息
Among the various tasks involved in SE & KE, requirements engineering, specification, prototyping, and validation are regarded as crucial since they decide whether a software system fulfills the users' expectations. Formal methods provide a rigorous framework to support these tasks and some relevant features can be in that way captured and formally guaranteed. logic programming has been recently shown as a promising candidate regarding these concerns. Nevertheless, formalism does need some explanation to let it be more readable and understandable. This paper focuses on a specification design method which mixes formal text (represented by a logic program) and comments (using either formal or informal assertions). By the design of a specification we refer to the intertwined tasks of describing the specification and improving it by the investigation of proofs. These proofs aim to verify the link between the specification and the comments, and are partly automated. Then we present our practical experience in the use of an interactive proof system. As an example, we show how this methodology is currently applied to the draft of standard Prolog.
暂无评论