Results 1  10
of
596
Knowledge Interchange Format Version 3.0 Reference Manual
, 1992
"... : Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract

Cited by 484 (14 self)
 Add to MetaCart
: Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions
Logic Programming in the LF Logical Framework
, 1991
"... this paper we describe Elf, a metalanguage intended for environments dealing with deductive systems represented in LF. While this paper is intended to include a full description of the Elf core language, we only state, but do not prove here the most important theorems regarding the basic building b ..."
Abstract

Cited by 188 (53 self)
 Add to MetaCart
languages, type checking and type inference, etc. The basic idea behind Elf is to unify logic definition (in the style of LF) with logic programming (in the style of Prolog, see [22, 24]). It achieves this unification by giving types an operational interpretation, much the same way that Prolog gives certain
A New Deconstructive Logic: Linear Logic
, 1995
"... The main concern of this paper is the design of a noetherian and confluent normalization for LK 2 (that is, classical second order predicate logic presented as a sequent calculus). The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different a ..."
Abstract

Cited by 127 (11 self)
 Add to MetaCart
as Girard's LC and Parigot's , FD ([9, 11, 27, 31]), delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programmingwithproofs' ([22, 23]) to classical logic; it is painless: since we reduce strong normalization and confluence to the same
Well Founded Semantics for Logic Programs with Explicit Negation
 EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1992
"... The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11 ..."
Abstract

Cited by 130 (54 self)
 Add to MetaCart
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised
Substructural logic and partial correctness
 Trans. Computational Logic
"... We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models. As a corollary we obtain a comple ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
complete sequent calculus for inclusion and equivalence of regular expressions. Categories and Subject Descriptors: D.2.2 [Software Engineering]: Tools and Techniques— structured programming; D.2.4 [Software Engineering]: Program Verification—correctness
Automatic Termination Analysis of Logic Programs
 Proceedings of the Fourteenth International Conference on Logic Programming
, 1997
"... This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms. It ca ..."
Abstract

Cited by 63 (3 self)
 Add to MetaCart
This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be nontermination. The system can use any norm of a wide family of norms
Abduction Over 3Valued Extended Logic Programs
 IN INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING
, 1995
"... this paper, provides a representational expressivity that captures a wide variety of logical reasoning forms [6, 16, 22]. The two forms of negation, default and explicit, are not unrelated: the "coherence principle" stipulates that the latter entails the former. Of course, introducing expl ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
of this paper is that of tackling contradiction, with some generality, and in particular within our choice semantics of extended logic programs, WFSX. Although such issues can be appproached from a belief revision point of view, they can likewise, and equivalently, be thought of within
22nd Workshop on (Constraint) Logic Programming
, 2008
"... Permit granted by University Stuttgart [25/05/2007] Preface This volume contains all 11 papers presented at WLP 2008: 22nd Workshop on (Constraint) Logic Programming ..."
Abstract
 Add to MetaCart
Permit granted by University Stuttgart [25/05/2007] Preface This volume contains all 11 papers presented at WLP 2008: 22nd Workshop on (Constraint) Logic Programming
15819K: Logic Programming Lecture 22
, 2006
"... In this lecture we lift the forward chaining calculus from the ground to the free variable case. The form of lifting required is quite different from the backward chaining calculus. For Horn logic, the result turns out to be hyperresolution. 22.1 Variables in Forward Chaining Variables in backward c ..."
Abstract
 Add to MetaCart
In this lecture we lift the forward chaining calculus from the ground to the free variable case. The form of lifting required is quite different from the backward chaining calculus. For Horn logic, the result turns out to be hyperresolution. 22.1 Variables in Forward Chaining Variables in backward
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
that the automaton will follow? Social actors, naturally. Thus, there is a social struggle to assign goals to the network. But once the network is programmed, it imposes its logic to all its members (actors). Actors will have to play their strategies within the rules of the network. To assign different goals
Results 1  10
of
596