Downloads & Free Reading Options - Results

Includes bibliographical references and index

Includes bibliographical references and index

Includes bibliographical references and index

Includes bibliographical references and index

The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.

The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.

In recent work, semantic games of independence-friendly logic were studied in strategic form in terms of (mixed strategy) Nash equilibria. The class of strategic games of independence-friendly logic is contained in the class of win-loss, zero-sum two-player games. In this note we draw on the theory of linear programming to develop tools to analyze the value of such games. We give two applications of these tools to independence-friendly logic under the so-called equilibrium semantics.

Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \& D_1$ -- $exec(D_0 \& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules.

Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \& D_1$ -- $exec(D_0 \& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules.

Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \& D_1$ -- $exec(D_0 \& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules.

Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \& D_1$ -- $exec(D_0 \& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules.

Rules complement and extend ontologies on the Semantic Web. We refer to these rules as onto-relational since they combine DL-based ontology languages and Knowledge Representation formalisms supporting the relational data model within the tradition of Logic Programming and Deductive Databases. Rule authoring is a very demanding Knowledge Engineering task which can be automated though partially by applying Machine Learning algorithms. In this chapter we show how Inductive Logic Programming (ILP), born at the intersection of Machine Learning and Logic Programming and considered as a major approach to Relational Learning, can be adapted to Onto-Relational Learning. For the sake of illustration, we provide details of a specific Onto-Relational Learning solution to the problem of learning rule-based definitions of DL concepts and roles with ILP.

We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories.

We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories.

The Journal of Logic Programming 1993: Volume 15 , Issue CONTENTS. Digitized from IA1652909-07 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1993_15_index . Next issue: sim_journal-of-logic-and-algebraic-programming_1993-01_15_1-2 .

The Journal of Logic Programming 1995: Volume 24 , Issue Index. Digitized from IA1652909-07 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1995-06_23_3 . Next issue: sim_journal-of-logic-and-algebraic-programming_1995_24_contents .

The Journal of Logic and Algebraic Programming 1996: Volume 26 , Issue CONTENTS. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1996_26_index . Next issue: sim_journal-of-logic-and-algebraic-programming_1996-01_26_1 . Note: This issue has no cover

The Journal of Logic and Algebraic Programming 1996: Volume 26 , Issue CONTENTS. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1996_26_index . Next issue: sim_journal-of-logic-and-algebraic-programming_1996-01_26_1 . Note: This issue has no cover

This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Conference on Logic Programming (ICLP) in Flushing, New York City.

The Journal of Logic and Algebraic Programming 1998: Volume 34 , Issue Index. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1997-12_33_3 . Next issue: sim_journal-of-logic-and-algebraic-programming_1998_34_contents . Note: This issue has no cover

The Journal of Logic and Algebraic Programming 1998: Volume 34 , Issue Index. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1997-12_33_3 . Next issue: sim_journal-of-logic-and-algebraic-programming_1998_34_contents . Note: This issue has no cover

The sixteenth lecture of twenty from MIT's Structure and Interpretation of Computer Programs course.

The Journal of Logic and Algebraic Programming 1999: Volume 38 , Issue CONTENTS. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1999_38_index . Next issue: sim_journal-of-logic-and-algebraic-programming_1999-01_38_1 . Note: This issue has no cover

The Journal of Logic Programming 1992: Volume 14 , Issue Index. Digitized from IA1652909-07 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1992-08_13_4 . Next issue: sim_journal-of-logic-and-algebraic-programming_1992_14_contents .

The Journal of Logic and Algebraic Programming is an active peer-reviewed academic journal featuring original research papers, survey and review articles, tutorial expositions and historical studies in logic programming. It was established in 1984 and is published 6 times a year by Elsevier. The journal provides a platform for researchers, scientists, and computer scientists to publish original research articles, reviews, and perspectives covering a wide range of topics related to the theoretical foundations and practical applications of logic-based programming and algebraic programming languages. It publishes research on programming methodologies, program verification, logic programming languages, type systems, and formal methods. The journal features articles that explore the use of logic and algebraic techniques for program analysis, synthesis, and optimization. It covers research on program semantics, constraint solving, program transformation, and software engineering techniques based on logical and algebraic principles. The Internet Archive Collection contains microfilm published between 1984 and 1999 The Journal of Logic and Algebraic Programming can be found online at: www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming The ISSN is: 1567-8326 Publication History Journal of Logic Programming 0743-1066 (until vol.46, 2001) USA United States | The Journal of Logic and Algebraic Programming 1567-8326 Former titles (until 2014) NLD Netherlands

The Journal of Logic and Algebraic Programming is an active peer-reviewed academic journal featuring original research papers, survey and review articles, tutorial expositions and historical studies in logic programming. It was established in 1984 and is published 6 times a year by Elsevier. The journal provides a platform for researchers, scientists, and computer scientists to publish original research articles, reviews, and perspectives covering a wide range of topics related to the theoretical foundations and practical applications of logic-based programming and algebraic programming languages. It publishes research on programming methodologies, program verification, logic programming languages, type systems, and formal methods. The journal features articles that explore the use of logic and algebraic techniques for program analysis, synthesis, and optimization. It covers research on program semantics, constraint solving, program transformation, and software engineering techniques based on logical and algebraic principles. The Internet Archive Collection contains microfilm published between 1984 and 1999 The Journal of Logic and Algebraic Programming can be found online at: www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming The ISSN is: 1567-8326 Publication History Journal of Logic Programming 0743-1066 (until vol.46, 2001) USA United States | The Journal of Logic and Algebraic Programming 1567-8326 Former titles (until 2014) NLD Netherlands

The Journal of Logic and Algebraic Programming is an active peer-reviewed academic journal featuring original research papers, survey and review articles, tutorial expositions and historical studies in logic programming. It was established in 1984 and is published 6 times a year by Elsevier. The journal provides a platform for researchers, scientists, and computer scientists to publish original research articles, reviews, and perspectives covering a wide range of topics related to the theoretical foundations and practical applications of logic-based programming and algebraic programming languages. It publishes research on programming methodologies, program verification, logic programming languages, type systems, and formal methods. The journal features articles that explore the use of logic and algebraic techniques for program analysis, synthesis, and optimization. It covers research on program semantics, constraint solving, program transformation, and software engineering techniques based on logical and algebraic principles. The Internet Archive Collection contains microfilm published between 1984 and 1999 The Journal of Logic and Algebraic Programming can be found online at: www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming The ISSN is: 1567-8326 Publication History Journal of Logic Programming 0743-1066 (until vol.46, 2001) USA United States | The Journal of Logic and Algebraic Programming 1567-8326 Former titles (until 2014) NLD Netherlands

The Journal of Logic and Algebraic Programming is an active peer-reviewed academic journal featuring original research papers, survey and review articles, tutorial expositions and historical studies in logic programming. It was established in 1984 and is published 6 times a year by Elsevier. The journal provides a platform for researchers, scientists, and computer scientists to publish original research articles, reviews, and perspectives covering a wide range of topics related to the theoretical foundations and practical applications of logic-based programming and algebraic programming languages. It publishes research on programming methodologies, program verification, logic programming languages, type systems, and formal methods. The journal features articles that explore the use of logic and algebraic techniques for program analysis, synthesis, and optimization. It covers research on program semantics, constraint solving, program transformation, and software engineering techniques based on logical and algebraic principles. The Internet Archive Collection contains microfilm published between 1984 and 1999 The Journal of Logic and Algebraic Programming can be found online at: www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming The ISSN is: 1567-8326 Publication History Journal of Logic Programming 0743-1066 (until vol.46, 2001) USA United States | The Journal of Logic and Algebraic Programming 1567-8326 Former titles (until 2014) NLD Netherlands

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

We propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine a probability distribution over answer sets. In contrast to related approaches, we approach inference by optionally utilizing so-called streamlining XOR constraints, in order to reduce the number of computed answer sets. Our approach is prototypically implemented. Examples illustrate the introduced concepts and point at issues and topics for future research.

The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be used for deciding between contradictory goals. Queries will be supported by arguments that could be defeated by other arguments. A query q will succeed when there is an argument A for q that is warranted, ie, the argument A that supports q is found undefeated by a warrant procedure that implements a dialectical analysis. The defeasible argumentation basis of DeLP allows to build applications that deal with incomplete and contradictory information in dynamic domains. Thus, the resulting approach is suitable for representing agent's knowledge and for providing an argumentation based reasoning mechanism to agents.

Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, we first generalize a version of the lifting lemma, by extending the relation "is more general than" so that it takes into account only some arguments of the atoms. The other arguments, which we call neutral arguments, are disregarded. Then we propose two syntactic conditions of increasing power for identifying neutral arguments from mere inspection of the text of a logic program.

The Structure and Interpretation of Computer Programs

Z80 Programming for Logic Design 1978 - Osborne

The Journal of Logic Programming 1985: Volume 2 , Issue Index. Digitized from IA1652909-07 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1984-12_1_4 . Next issue: sim_journal-of-logic-and-algebraic-programming_1985_2_contents .

The Journal of Logic and Algebraic Programming 1997: Volume 33 , Issue Index. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1997-09_32_3 . Next issue: sim_journal-of-logic-and-algebraic-programming_1997_33_contents . Note: This issue has no cover

The Journal of Logic and Algebraic Programming 1998: Volume 37 , Issue CONTENTS. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1998_37_index . Next issue: sim_journal-of-logic-and-algebraic-programming_october-december-1998_37_1-3 . Note: This issue has no cover

The Journal of Logic and Algebraic Programming 1998: Volume 37 , Issue CONTENTS. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1998_37_index . Next issue: sim_journal-of-logic-and-algebraic-programming_october-december-1998_37_1-3 . Note: This issue has no cover

Thesis advisor, Cheng-Tsu Wu

Tandy/Radio Shack Book: Z80 Programming for Logic Design (1978)(Osborne and Associates)

Tandy/Radio Shack Book: Z80 Programming for Logic Design (1978)(Osborne and Associates)

Video content can be found here: https://www.youtube.com/channel/UC0BAd8tPlDqFvDYBemHcQPQ/

my

my

my

my

my

The Journal of Logic and Algebraic Programming 1996: Volume 29 , Issue Index. Digitized from IA1652909-05 . Previous issue: sim_journal-of-logic-and-algebraic-programming_1996-09_28_3 . Next issue: sim_journal-of-logic-and-algebraic-programming_1996_29_contents .

From the bitsavers.org collection, a scanned-in computer-related document. test equipment :: hp :: 166x :: 01660-90902 1660-Series 100-MHz State 500-MHz Timing Logic Analyzers Programming Guide Aug92

Includes bibliographical references and index