The Advanced Computational Methods Center, University of Georgia
Terry Rankin
Donald Nute1986, Ai Magazine - AIM
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
AI
AI
This paper discusses the development of a nonmonotonic reasoning system called PROWIS, based on the PROLOG programming language, designed to improve upon traditional monotonic reasoning systems by accommodating subjunctive conditionals and managing the complexities arising from rule interactions. The system aims to address issues such as unexpected results due to rule chaining by incorporating conditional goals and specialized interaction mechanisms with knowledge engineers. Additionally, the CYCLOPS project explores leveraging the parallel capabilities of the CYBERPLUS computer to enhance the efficiency of knowledge base construction and rule evaluation.
Related papers
Artificial intelligence research at the advanced computational methods center, University of Georgia
A logic programming system for nonmonotonic reasoning
Journal of Automated Reasoning, 1995
The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms.
Logic Programming with Prolog
2013
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.
Prolegomena to logic programming for non-monotonic reasoning
1997
The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the principal formalisms and approaches, augmented with examples.
Logical Decision Rules: Teaching C4.5 to Speak Prolog
2000
It is desirable to automatically learn the effects of actions in an unknown environment. C4.5 has been used to discover associations, and it can also be used to find causal rules. Its output consists of rules that predict the value of a decision attribute using some condition attributes. Integrating C4.5’s results in other applications usually requires spending some effort in translating them into a suitable format. Since C4.5’s rules are horn clauses and have the same expressive power as Prolog statements, we have modified standard C4.5 so it will optionally generate its rules in Prolog. We have made sure no information is lost in the conversion process. It is also possible for the prolog statements to optionally retain the certainty values that C4.5 computes for its rules. This is achieved by simulating the certainty values as the probability that the statement will fail for no apparent reason. Prolog can move from statement to statement and find a series of rules that have to be fired to get from a set of premises to a desired result. We briefly mention how, when dealing with temporal data, the Prolog statements can be used for recursive searches, thus making C4.5’s output more useful.
Logic programming and knowledge representation—The A-Prolog perspective
Artificial Intelligence, 2002
In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in articial intelligence. We consider extensions of the language of denite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language. We also discuss extensions of logic programming allowing abductive reasoning, meta-reasoning and reasoning in open domains. We investigate the methodology of using these languages for representing various forms of nonmonotonic reasoning and for describing knowledge in specic domains. We also address recent work on properties of programs needed for sucessful applications of this methodology such as consistency, categoricity and complexity.
Prolog Programming and Applications
1985
All rights reserved. No reproduction, copy or transmission of this publication may be made without written permission. No paragraph of this publication may be reproduced, copied or transmitted save with written permission or in accordance with the provisions of the Copyright Act 1956 (as amended). Any person who does any unauthorised act in relation to this publication may be liable to criminal prosecution and civil claims for damages.
Towards a New Logic of Indicative Conditionals
In this paper I will propose a refinement of the semantics of hypervaluations (Mura 2009), one in which a hypervaluation is built up on the basis of a set of valuations, instead of a single val-uation. I shall define validity with respect to all the subsets of valua-tions. Focusing our attention on the set of valid sentences, it may easily shown that the rule substitution is restored and we may use valid schemas to represent classes of valid sentences sharing the same logical form. However, the resulting semantical theory TH turns out to be throughout a modal three-valued theory (modal sym-bols being definable in terms of the non modal connectives) and a fragment of it may be considered as a three-valued version of S5 system. Moreover, TH may be embedded in S5, in the sense that for every formula ϕ of TH there is a corresponding formula ϕ' of S5 such that ϕ' is S5-valid iff ϕ is TH-valid. The fundamental property of this system is that it allows the definition of a purely semantical relation of logical consequence which is coextensive to Adams’ p-entailment with respect to simple conditional sentences, without be-ing defined in probabilistic terms. However, probability may be well be defined on the lattice of hypervaluated tri-events, and it may be proved that Adam’s p-entailment, once extended to all tri-events, coincides with our notion of logical consequence as defined in purely semantical terms.
Introduction to the special issue on Prolog systems
Theory and Practice of Logic Programming, 2012
It has now been 40 years since the birth of the Prolog language and of its first implementation by A. Colmerauer and P. Roussel. Since then, a large number of Prolog systems have been implemented. While thecoreof the Prolog language has not changed much in these 40 years, Prolog systems have undergone an extraordinary evolution that stems from two main sources. One is the trend to extend Prolog to incorporate ideas from other language paradigms that have proved useful in real-world applications. This includes concurrency, parallelism, higher order predicates, object-oriented programming, Web interfaces, processing of large amounts of data, and flexible developer tools that enhance reliability and robustness through assertions. A second source of change is the exploration of ideas for which Prolog systems are uniquely suitable and that have led to the creation of new programming paradigms. This includes tabling, constraint logic programming, answer set programming, and probabilistic ...
Related papers
A Dynamic Logic-Based Modal Prolog
2012 11th Mexican International Conference on Artificial Intelligence, 2012
The field of modal logic programming has been developed to extend the expressiveness of logic programming. By introducing the modal operators of necessity and possibility within the language of Horn clauses, modal logic programming languages retain its declarative nature without resorting to non-logical features. DL Prolog is a modal logic programming language extending pure Prolog with dynamic logic modalities able to embed efficient imperative programs, while retaining a declarative reading. Furthermore it provides the means to isolate non-logical features of metapredicates (like cut and is) into semantically equivalent dynamic logic modalities. The contributions of this paper are twofold: firstly, the application of the dynamic logic-based modal Prolog to embed efficient programs for numeric computation, and secondly, the soundness proof of this modal Prolog through a logical system with inference rules written in the Gentzen sequent style.
Conditional reasoning in logic programming
The Journal of Logic Programming, 2000
We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge base may result from an update. We develop an abductive semantics which captures dierent evolutions of the knowledge base. Furthermore, we provide a goal-directed abductive proof procedure to compute the alternative solutions for a goal. We ®nally analyze our conditional programming language in the context of belief revision theory, and we establish a connection with Nebel's prioritized base revision.
Nonmonotonic Reasoning with Logic Programming
Journal of Logic Programming, 1993
Our purpose is to exhibit a modular systematic method of representing non-monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with explicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning problems. We show how to cast in the language of logic programs extended with explicit negation such forms of non-monotonic reasoning as defeasible reasoning, abductive reasoning, and hypothetical reasoning and apply them to such different domains of knowledge representation as hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in a logic programming semantics comprising two forms of negation avoiding some drawbacks of other proposals, with which we relate our work.
A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming
Journal of Logic Programming, 1998
Impressive work has been done in the last years concerning the meaning of negation and disjunction in logic programs, but most of this research concentrated on propositional programs only. While it su ces to consider the propositional case for investigating general properties and the overall behaviour of a semantics, we feel that for real applications and for computational purposes an implementation should be able to handle rst-order programs without grounding them. In this paper we present a theoretical framework by de ning a calculus of program transformations that apply directly to rules with variables and function symbols. Our main results are that (a) this calculus is weakly con uent for arbitrary programs, (b) it is terminating for Datalog _;: programs, (c) for nite ground programs it is equivalent to a terminating calculus introduced by Brass and Dix (1995), and (d) it approximates a generalisation of D-WFS for arbitrary programs. We achieve this by transforming program rules into rules with equational constraints thereby using heavily methods and techniques from constraint logic programming (CLP). In particular, disconnection-methods play a crucial role. In principle, any constraint theory known from CLP can be exploited in the context of non-monotonic reasoning, not only equational constraints over the Herbrand domain. However, the respective constraint solver must be able to treat negative constraints of the considered constraint domain. In summary, this work yields the basis for a general combination of two paradigms: constraint logic programming and non-monotonic reasoning. This is a completely revised and extended version of DS97], originally presented at the Postconference Workshop on Non-monotonic Extensions of LP following JICSLP '96, Bad Honnef, Germany, September 7{8, 1996. 1 Recent years have seen an enormous number of di erent semantics of logic programs with negation. Fewer semantics have been developed for disjunctive programs and nearly all approaches assume \without loss of generality"|as most authors put it|that the underlying programs are grounded, i.e. they do not contain variables. However, we think that one of the most important advantages of the logic programming paradigm and therefore the success of Prolog is its ability to compute answer-substitutions for a given query with variables.
Logic Programming and Nonmonotonic Reasoning: 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings
2005
This book constitutes the refereed proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005, held in Diamante, Italy in September 2005. The 25 revised full papers, 16 revised for the system and application tracks presented together with 3 invited papers were carefully reviewed and selected for presentation.
A-Prolog as a tool for declarative programming
2000
Abstract: In this paper we give a brief introduction to the declarative knowledge representation and logic programming language A-Prolog. We demonstrate the methodology of programming in A-Prolog by developing a simple declarative program ...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.