We distill Penrose's argument against the "artificialintelligence premiss", and analyze its logical alternatives. We then clarify the different positions one can take in answer to the question raised by...
详细信息
ISBN:
(纸本)354030553X
We distill Penrose's argument against the "artificialintelligence premiss", and analyze its logical alternatives. We then clarify the different positions one can take in answer to the question raised by the argument, skirting the issue of introspection per se.
Defeasible logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference p...
详细信息
ISBN:
(纸本)354030553X
Defeasible logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally, we illustrate the language by an example of an agent reasoning about web-services.
the logic FO(ID) extends classical first order logic with inductive definitions. this paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in th...
详细信息
ISBN:
(纸本)354030553X
the logic FO(ID) extends classical first order logic with inductive definitions. this paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logicprogramming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MIDL, experimentally validating our approach.
We propose a characterization of provability in Bl's Pointer logic (PL) that is based on semantic structures called resource graphs. this logic has been defined for reasoning about mutable data structures and resu...
详细信息
ISBN:
(纸本)354030553X
We propose a characterization of provability in Bl's Pointer logic (PL) that is based on semantic structures called resource graphs. this logic has been defined for reasoning about mutable data structures and results about models and verification have been already provided. Here, we define resource graphs that capture PL models by considering heaps as resources and by using a labelling process. We study provability in PL from a new calculus that builds such graphs from which proofs or countermodels can be generated. Properties of soundness and completeness are proved and the countermodel generation is studied.
FLORA-2 is an advanced knowledge representation system that integrates F-logic, HiLog, and Transaction logic. In this paper we give an overview of the theoretical foundations of the system and of some of the aspects o...
详细信息
ISBN:
(纸本)3540285385
FLORA-2 is an advanced knowledge representation system that integrates F-logic, HiLog, and Transaction logic. In this paper we give an overview of the theoretical foundations of the system and of some of the aspects of nonmonotonic reasoning in FLORA-2. these include scoped default negation, behavioral inheritance, and nonmonotonicity that stems from database dynamics.
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, a...
详细信息
ISBN:
(纸本)3540285385
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, an algebraic theory which generalizes the semantics of several non-monotonic reasoning formalisms. this allows us to apply certain abstract modularity theorems, developed within the framework of approximation theory, to ID-logic. As such, we are able to offer elegant and simple proofs of generalizations of known theorems, m well as some new results.
In this note we discuss the expressive power of mu-calculi. We concentrate on those that are extensions of propositional modal logics with a fixpoint operator. the objective is to try to match the expressive power of ...
详细信息
ISBN:
(纸本)3540252363
In this note we discuss the expressive power of mu-calculi. We concentrate on those that are extensions of propositional modal logics with a fixpoint operator. the objective is to try to match the expressive power of monadic second-order logic. We consider different kinds of models: from trees and transition systems tip to traces and timed systems.
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style. the logic see...
详细信息
ISBN:
(纸本)354030553X
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style. the logic seems particularly useful in settings where non constant domain Kripke models play a role. In this paper it is proved that these systems have interpolation and the Beth definability property.
暂无评论