Results 1  10
of
720,567
On modal logic interpretations of games
 In Procs ECAI 2002
, 2002
"... Abstract. Multiagent environments comprise decision makers whose deliberations involve reasoning about the expected behavior of other agents. Apposite concepts of rational choice have been studied and formalized in game theory and our particular interest is with their integration in a logical speci ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. Multiagent environments comprise decision makers whose deliberations involve reasoning about the expected behavior of other agents. Apposite concepts of rational choice have been studied and formalized in game theory and our particular interest is with their integration in a logical
A Logical Interpretation of RDF
 Linköping University Electronic Press
, 2000
"... Preface – A Note to the Reader: This is a step towards a logicbased formalization of RDF. It grew out of the necessity to precisely capture the semantics of RDF schemata while developing an RDFbased modeling framework for web applications (XWMF). The rules and facts that are described in the follow ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Preface – A Note to the Reader: This is a step towards a logicbased formalization of RDF. It grew out of the necessity to precisely capture the semantics of RDF schemata while developing an RDFbased modeling framework for web applications (XWMF). The rules and facts that are described
Fuzzy Logics Interpreted as Logics of Resources
"... Girard’s linear logic (1987) is often interpreted as the logic of resources, while formal fuzzy logics (see esp. Hájek, 1998) are usually understood as logics of partial truth. I will argue that deductive fuzzy logics can be interpreted in terms of resources as well, and that under most circumstan ..."
Abstract
 Add to MetaCart
Girard’s linear logic (1987) is often interpreted as the logic of resources, while formal fuzzy logics (see esp. Hájek, 1998) are usually understood as logics of partial truth. I will argue that deductive fuzzy logics can be interpreted in terms of resources as well, and that under most circum
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 807 (18 self)
 Add to MetaCart
Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 628 (74 self)
 Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Dynamic Predicate Logic
, 1990
"... This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, nonrepresentational ..."
Abstract

Cited by 461 (2 self)
 Add to MetaCart
This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, non
A probability logical interpretation of fallacies
 In
, 2008
"... Abstract This chapter presents a probability logical approach to fallacies. A special interpretation of (subjective) probability is used, which is based on coherence. Coherence provides not only a foundation of probability theory, but also a normative standard of reference for distinguishing fallaci ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract This chapter presents a probability logical approach to fallacies. A special interpretation of (subjective) probability is used, which is based on coherence. Coherence provides not only a foundation of probability theory, but also a normative standard of reference for distinguishing
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of hornclause logic programs. We show how to perform derivations in this logic using a
THE ROLE OF LOGICAL INTERPRETATIONS IN PROGRAM DEVELOPMENT
, 2011
"... Vol. 10(1:1)2014, pp. 1–39 www.lmcsonline.org ..."
Computational Interpretations of Linear Logic
 Theoretical Computer Science
, 1993
"... We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the CurryHoward isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order of evaluati ..."
Abstract

Cited by 318 (3 self)
 Add to MetaCart
We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the CurryHoward isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order
Results 1  10
of
720,567