161.
Extending Classical Logic with Inductive Definitions
- Marc Denecker
The goal of this paper is to extend classical logic with
a generalized notion of inductive definition supporting
positive and negative induction, to investigate the
properties of this logic, its relationships to other logics
in the area of non-monotonic reasoning, logic programming
and deductive databases, and to show its application
for knowledge representation by giving a typology
of definitional knowledge.
162.
Extending Classical Logic with Inductive De nitions
- De Nitions,Marc Denecker
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.
163.
El mercado y sus marcas: los nuevos territorios y contradicciones teóricas de la investigación en comunicación
- Sierra Caballero, Francisco
Producir es crear, fabricar, por elaboración colectiva, un fruto, ocasionar o causar un bien, un beneficio público. Ahora bien, en la actual etapa de desarrollo social del tardocapitalismo, la economía es sobre todo circulación. Frente a la producción y el consumo, el eterno retorno de la circulación de bienes, servicios y mensajes nos hace perder, a fuerza de movimiento, el sentido mismo de la dirección ("pro"). La producción, en otras palabras, obedece, más allá de todo proceso de acción inductiva y de pensamiento deductivo, a una lógica de la ducción, esto es, a la ampliación ilimitada de los espacios de...
164.
Extending Classical Logic with Inductive Definitions
- Marc Denecker
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.
165.
Extending Classical Logic with Inductive Definitions
- Marc Denecker
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.
166.
Extending Classical Logic with Inductive Definitions
- Marc Denecker
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.
167.
An Epistemic Foundation for Logic Programming with Uncertainty
- Laks V.S. Lakshmanan
this paper is primarily with probabilistic extensions to logic programming and deductive databases. Substantial work has been done in this area (see Section 6 for a brief survey). One criticism (e.g. see [17]) leveled against probabilistic approaches for uncertainty management is how the probabilities representing degree of likelihood can be
168.
A Five-Valued Logic and a System
- Ferreira, Ulisses
The present article introduces a five-valued logic and a deductive system. Here, the logic presented is a relevant fragment of the @-logic, which is also a space-time logic. These five values correspond to the following semantics: unknown, possibly known but
consistent, false, true, and inconsistent. The present logic and the PLAIN programming language are two results of the same intuitions and from the same
philosophical view. Finally, as well as the purposes of PLAIN, the logic ought to be used to support (mobile) agents systems in some manner, besides general
purposes.
169.
Differential dynamic logic for verifying parametric hybrid systems
- André Platzer
Abstract. We introduce a first-order dynamic logic for reasoning about systems with discrete and continuous state transitions, and we present a sequent calculus for this logic. As a uniform model, our logic supports hybrid programs with discrete and differential actions. For handling real arithmetic during proofs, we lift quantifier elimination to dynamic logic. To obtain a modular combination, we use side deductions for verifying interacting dynamics. With this, our logic supports deductive verification of hybrid systems with symbolic parameters and first-order definable flows. Using our calculus, we prove a parametric inductive safety constraint for speed supervision in a train control...
170.
Media - Formalization and Architecture
- Ulrike Lechner,Beat F. Schmid
. Media are explored as model to envision, to design and to
formalize platforms for communities of collaborating human or articial
agents. Seminal to our approach are the media concept and the media
reference model. The media concept envisions media as platforms of
multi-agent systems and the media reference model determines the main
components of a medium and guides its application, e.g., in ECommerce
or Knowledge Management. The contributions of this paper are a formalization
and an architecture for media. The goal is to facilitate articial
agents to reason about media and to act on media autonomously in performing
transactions.
Keywords. Medium, Multi Agent System, Logic, Labelled Deductive
System, Rewriting Logic.
1...
171.
Media - Formalization and Architecture
- Ulrike Lechner; Beat F. Schmid
. Media are explored as model to envision, to design and to formalize platforms for communities of collaborating human or articial agents. Seminal to our approach are the media concept and the media reference model. The media concept envisions media as platforms of multi-agent systems and the media reference model determines the main components of a medium and guides its application, e.g., in ECommerce or Knowledge Management. The contributions of this paper are a formalization and an architecture for media. The goal is to facilitate articial agents to reason about media and to act on media autonomously in performing transactions....
172.
A Knowledge Representation Framework Based on Epistemic Logic
- Teodor Przymusinski
We introduce a uniform non-monotonic framework for knowledge representation based on epistemic
logic which is sufficiently general to encompass several non-monotonic formalisms, including
circumscription, autoepistemic logic, various semantics proposed for logic programs and deductive
databases (stable semantics, well-founded semantics and stationary semantics) as well as Gelfond's
epistemic specifications.
The existence of such a uniform framework allows us not only to provide simpler and perhaps
more natural definitions of various formalisms but it also enables us to better understand mutual
relationships existing between them.
Keywords: Non-monotonic reasoning, semantics of logic programs, disjunctive logic programs
and deductive databases.
1 Introduction
In recent years, various approaches to non-monotonic reasoning and different semantics for normal
and...
173.
August 2, 1993 Revised March 28, 1994
- Chiaki Sakama,Katsumi Inoue
In this paper, we study a new semantics of logic programming and
deductive databases. The possible model semantics is introduced as a
declarative semantics of disjunctive logic programs. The possible model
semantics is an alternative theoretical framework to the classical minimal
model semantics and provides a flexible inference mechanism for
inferring negation in disjunctive logic programs. We also present a
proof procedure for the possible model semantics and show that the
possible model semantics has an advantage from the computational
complexity point of view.
Keywords: Disjunctive logic programs, possible model semantics,
closed world assumption, model generation procedure.
3
Journal of Automated Reasoning 13: 145-172, Kluwer Academic, 1994.
1
1 Introduction
Traditionally, the declarative semantics of...
174.
Whose Norm?
e to the published
version.
normative notion of reasoning, such as Bayesian probability theory. If, however, your
goal is to understand or model however the subjects actually do reason, normative
notions of reasoning are simply irrelevant.
Although deductive logic and Bayesian probability are the prime contenders for a model
of normative rationality, Henry E. Kyburg, Jr. argues for nonmonotonic acceptance
theory as the normative theory. Mike Oaksford and Nick Chater argue that deductive
logic is not relevant for understanding commonsense reasoning, but that probability
theory is the most promising candidate for a normative theory.
Stuart Russell argues for bounded optimality as a model of commonsense reasoning,
while Gerd Gigerenzer, Jean Czerlinski,...
175.
Whose Norm? - Review of: Common Sense, Reasoning, Rationality, Edited by Rene Elio, Oxford University Press, 2002
- Stuart Shapiro
e to the published version. normative notion of reasoning, such as Bayesian probability theory. If, however, your goal is to understand or model however the subjects actually do reason, normative notions of reasoning are simply irrelevant. Although deductive logic and Bayesian probability are the prime contenders for a model of normative rationality, Henry E. Kyburg, Jr. argues for nonmonotonic acceptance theory as the normative theory. Mike Oaksford and Nick Chater argue that deductive logic is not relevant for understanding commonsense reasoning, but that probability theory is the most promising candidate for a normative theory. Stuart Russell argues for bounded optimality...
176.
August 2, 1993 Revised March 28, 1994
- Ed Mar Ch; Chiaki Sakama; Katsumi Inoue
In this paper, we study a new semantics of logic programming and deductive databases. The possible model semantics is introduced as a declarative semantics of disjunctive logic programs. The possible model semantics is an alternative theoretical framework to the classical minimal model semantics and provides a flexible inference mechanism for inferring negation in disjunctive logic programs. We also present a proof procedure for the possible model semantics and show that the possible model semantics has an advantage from the computational complexity point of view. Keywords: Disjunctive logic programs, possible model semantics, closed world assumption, model generation procedure. 3 Journal of...
177.
A Knowledge Representation Framework Based on Epistemic Logic
- Teodor Przymusinski
We introduce a uniform non-monotonic framework for knowledge representation based on epistemic logic which is sufficiently general to encompass several non-monotonic formalisms, including circumscription, autoepistemic logic, various semantics proposed for logic programs and deductive databases (stable semantics, well-founded semantics and stationary semantics) as well as Gelfond's epistemic specifications. The existence of such a uniform framework allows us not only to provide simpler and perhaps more natural definitions of various formalisms but it also enables us to better understand mutual relationships existing between them. Keywords: Non-monotonic reasoning, semantics of logic programs, disjunctive logic programs and deductive databases. 1 Introduction In recent...
178.
Razonamiento revocable y lógicas no monótonas: un análisis conceptual
- Legris, Javier
Se llama revocables a todos aquellos razonamientos no deductivos en los cuales la conclusión es obtenida a partir de información incompleta es decir a partir de premisas que representan condiciones insuficientes para afirmar la conclusión. En los razonamientos revocables nueva información que se agregue a las premisas puede invalidar la inferencia hecha pues daría lugar a inconsistencias. Así la relación de inferencia que subyace a los razonamientos revocables no cumple con la propiedad de monotonía que satisface la relación usual de inferencia deductiva. Las lógicas no monótonas han surgido con la idea de formalizar este tipo de razonamientos. En este...
179.
HiLog: A foundation for higher-order logic programming
- Weidong Chen; Michael Kifer; David S. Warren
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate calculus. But its semantics is first-order and admits a sound and complete proof procedure. Applications of HiLog are discussed, including DCG grammars, higher-order and modular logic programming, and deductive databases.
180.
$rec.titulo
This paper describes the design of a pattern matcher for a knowledge representation system called LOOM. The pattern matcher has a very rich pattern-forming language, and is logic-based, with a deductive mechanism which includes a truth-maintenance componentasanintegral part of the pattern-matching logic. The technology behind the LOOM matcher uses an inference engine called a classi er to perform the matches. The LOOM matcher is more expressive and more complete than previous classi cationbased pattern-matchers, and is expected to be signi cantly more e cient. 1
