Results 1 - 10 of 96

A Prolog-like Inference System for Computing Minimum-Cost Abductive Explanations in Natural-Language Interpretation

by Mark E. Stickel , 1988
"... By determining what added assumptions would suffice to make the logical form of a sentence in natural language provable, abductive inference can be used in the interpretation of sentences to determine what information should be added to the listener's knowledge, i.e., what he should learn from ..."
Abstract - Cited by 60 (1 self) - Add to MetaCart
-synthesis applications of abduction. The assignment of numerical costs to axioms and assumable literals permits specification of preferences on different abductive explanations. A new Prolog-like inference system that computes abductive explanations and their costs is given. To facilitate the computation of minimum

Polymorphic Higher-Order Programming in Prolog

by unknown authors
"... Abstract Pure logic programming lacks some features known from other modern programming languages, e.g., type systems for detection of particular programming errors at compile time and higher-order facilities for treating programs as data objects and writing more compact programs. On the one hand th ..."
Abstract - Add to MetaCart
of the polymorphic type systems. This paper presents a polymorphic type system for logic programming which allows the application of higher-order programming techniques. For Prolog-like applications of higher-order programming techniques it is possible to compute optimizations by abstract interpretation so

A Prolog like temporal reasoning system

by T. Panayiotopoulos, M. Gergatsoulis - in Proc. of 13th IASTED International Conference on APPLIED INFORMATICS , 1995
"... An extension of the Horn clause logic programming language (PROLOG), called Horn Temporal Reference Language (HTRL), suitable for temporal reasoning is presented in this paper. The syntax of the HTRL language is given and its informal semantics is briefly presented. An implementation through the tra ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
An extension of the Horn clause logic programming language (PROLOG), called Horn Temporal Reference Language (HTRL), suitable for temporal reasoning is presented in this paper. The syntax of the HTRL language is given and its informal semantics is briefly presented. An implementation through

Exstensions of Deductive Concept in Logic Programing and Some Applications

by Ivana Berković, Biljana Radulović, Petar Hotomski
"... Abstract. The paper presents ATP – a system for automated theorem proving based on ordered linear resolution with marked literals, its putting into the base of prolog-like language and some applications. This resolution system is especially put into the base of prolog-like language, as the surrogate ..."
Abstract - Add to MetaCart
Abstract. The paper presents ATP – a system for automated theorem proving based on ordered linear resolution with marked literals, its putting into the base of prolog-like language and some applications. This resolution system is especially put into the base of prolog-like language

LOGIC PROGRAMMING cum APPLICATIVE PROGRAMMING* ABSTRACT

by Nachum Dershowitz
"... Conditional (directed) equations provid' ~ a paradigm of computation that combines the cl(',, ~ svntax and semantics of both PROLOG-like logic p'rogra~ming and (first-order) LIsP-like applicative (functional) programming in a uniform manner. For applicative programming, equations are ..."
Abstract - Add to MetaCart
Conditional (directed) equations provid' ~ a paradigm of computation that combines the cl(',, ~ svntax and semantics of both PROLOG-like logic p'rogra~ming and (first-order) LIsP-like applicative (functional) programming in a uniform manner. For applicative programming, equations

Programming in Lygon: An Overview

by James Harland, David Pym, Michael Winikoff - ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY , 1996
"... Recently, there has been much interest in the derivation of logic programming languages based on linear logic, a logic of resource-consumption. Such languages provide a notion of resource-oriented programming, often leading to programs that are more elegant and concise than their equivalents in la ..."
Abstract - Cited by 43 (18 self) - Add to MetaCart
. In common with other linear logic programming languages, Lygon allows clauses to be used exactly once in a computation, thereby avoiding the need for the explicit resource-counting often necessary in Prolog-like languages. Indeed, it appears that resource-sensitivity leads to significant differences

Sophia: An information plane for networked systems

by Mike Wawrzoniak, Larry Peterson, Timothy Roscoe , 2004
"... This paper motivates and describes an example network Information Plane, called Sophia, currently deployed on PlanetLab. Sophia is a distributed system that collects, stores, propagates, aggregates, and reacts to observations about the network’s current conditions. Sophia’s approach is novel: it can ..."
Abstract - Cited by 97 (7 self) - Add to MetaCart
: it can be viewed as a multi-user distributed expression evaluator in which sensors and actuators form the ground terms, and statements take on the complete expressiveness of a logic language like Prolog. This paper argues that this approach has several advantages in managing and controlling a complex

Denotational and operational semantics for prolog

by Saumya K. Debray, Prateek Mishra - Journal of Logic Programming , 1988
"... Abstract: The semantics of Prolog programs is usually given in terms of the model theory of first order logic. However, this does not adequately characterize the computational behavior of Prolog programs. Prolog implementations typically use a sequential evaluation strategy based on the textual orde ..."
Abstract - Cited by 56 (4 self) - Add to MetaCart
order of clauses and literals in a program, as well as non-logical features like ‘‘cut’’. In this work we develop a denotational semantics that captures the computational behavior of Prolog. We present a semantics for ‘‘cut-free’ ’ Prolog, which is then extended to Prolog with cut. For each case we

Discrete sequence prediction and its applications

by Philip Laird, Ronald Saul, Philip Laird, Ronald Saul - Machine Learning , 1994
"... Learning from experience to predict sequences of discrete symbols is a fundamental problem in machine learning with many applications. We present a simple and practi-ca] algorithm (TDAG) for discrete sequence prediction. Based on a text-compression method, the TDAG algorithm limits the growth of sto ..."
Abstract - Cited by 36 (2 self) - Add to MetaCart
of storage by retaining the most likely prediction contexts and discarding (forgetting) less likely ones. The storage/speed tradeoffs are parameterized so that the algorithm can be used in a variety of applications. Our experiments verify its performance on data compression tasks and show how it applies

What Is Answer Set Programming?

by Vladimir Lifschitz , 2008
"... Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules tha ..."
Abstract - Cited by 67 (9 self) - Add to MetaCart
that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.
Results 1 - 10 of 96