Results 1  10
of
34
FLogic: a higherorder language for reasoning about objects, inheritance, and scheme
, 1997
"... We propose a database logic which accounts in a clean declarative fashion for most of the “objectoriented” features such as object identity, complex objects, inheritance, methods, etc. Furthermore, database schema is part of the object language, which allows the user to browse schema and data using ..."
Abstract

Cited by 174 (9 self)
 Add to MetaCart
We propose a database logic which accounts in a clean declarative fashion for most of the “objectoriented” features such as object identity, complex objects, inheritance, methods, etc. Furthermore, database schema is part of the object language, which allows the user to browse schema and data using the same declarative formalism. The proposed logic has a formal semantics and a sound and complete resolutionbased proof procedure, which makes it also computationally attractive.
Reasoning About Action I: A Possible Worlds Approach
 Artificial Intelligence
, 1987
"... Reasoning about change is an important aspect of commonsense reasoning and planning. In this paper we describe an approach to reasoning about change for rich domains where it is not possible to anticipate all situations that might occur. The approach provides a solution to the frame problem, and to ..."
Abstract

Cited by 136 (7 self)
 Add to MetaCart
Reasoning about change is an important aspect of commonsense reasoning and planning. In this paper we describe an approach to reasoning about change for rich domains where it is not possible to anticipate all situations that might occur. The approach provides a solution to the frame problem, and to the related problem that it is not always reasonable to explicitly specify all of the consequences of actions. The approach involves keeping a single model of the world that is updated when actions are performed. The update procedure involves constructing the nearest world to the current one in which the consequences of the actions under consideration hold. The way we find the nearest world is to construct proofs of the negation of the explicit consequences of the expected action, and to remove a premise in each proof from the current world. Computationally, this construction procedure appears to be tractable for worlds like our own where few things tend to change with each action, or where ...
A Treatise on ManyValued Logics
 Studies in Logic and Computation
, 2001
"... The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with som ..."
Abstract

Cited by 52 (3 self)
 Add to MetaCart
The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with some hints toward applications which are based upon actual theoretical considerations about infinite valued logics. Key words: mathematical fuzzy logic, algebraic semantics, continuous tnorms, leftcontinuous tnorms, Pavelkastyle fuzzy logic, fuzzy set theory, nonmonotonic fuzzy reasoning 1 Basic ideas 1.1 From classical to manyvalued logic Logical systems in general are based on some formalized language which includes a notion of well formed formula, and then are determined either semantically or syntactically. That a logical system is semantically determined means that one has a notion of interpretation or model 1 in the sense that w.r.t. each such interpretation every well formed formula has some (truth) value or represents a function into
MultiValued Symbolic ModelChecking
 ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY
, 2003
"... This paper introduces the concept and the general theory of multivalued model checking, and describes a multivalued symbolic modelchecker \Chi Chek. Multivalued ..."
Abstract

Cited by 50 (16 self)
 Add to MetaCart
This paper introduces the concept and the general theory of multivalued model checking, and describes a multivalued symbolic modelchecker \Chi Chek. Multivalued
A Survey of Paraconsistent Semantics for Logic Programs
 HANDBOOK OF DEFEASIBLE REASONING AND UNCERTAINTY MANAGEMENT SYSTEMS
, 1998
"... In this chapter we motivate the use of paraconsistency, and survey the most salient paraconsistent semantics for (extended) logic programs, which are briefly defined and explained. Most of the semantics are accompanied with their multivalued model theory, giving them a new perspective. The surv ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
In this chapter we motivate the use of paraconsistency, and survey the most salient paraconsistent semantics for (extended) logic programs, which are briefly defined and explained. Most of the semantics are accompanied with their multivalued model theory, giving them a new perspective. The survey also presents new results regarding the embedding of part of these semantics into normal logic programs under WellFounded Semantics [20], Partial Stable Model Semantics (or stationary semantics) [48], and Stable Model Semantics [21]. Furthermore, a concise recapitulation of other related paraconsistent formalisms is made. The reader is assumed to have a good knowledge of the semantics of normal logic programs. We believe a comprehensive coverage of the topic as it stands at present is attained here.
Implementing a MultiValued Symbolic Model Checker
 In Proceedings of TACAS’01
, 2001
"... Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. In this paper, we present ..."
Abstract

Cited by 25 (11 self)
 Add to MetaCart
Multivalued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. In this paper, we present an implementation of a symbolic model checker for multivalued temporal logics. The model checker works for any multivalued logic whose truth values form a quasiboolean lattice. Our models are generalized Kripke structures, where both atomic propositions and transitions between states may take any of the truth values of a given multivalued logic. Properties to be model checked are expressed in CTL, generalized with a multivalued semantics. The design of the model checker is based on the use of MDDs, a multivalued extension of Binary Decision Diagrams. We describe MDDs and their use in the model checker. We also give its theoretical time complexity and some preliminary empirical performance data.
Paraconsistent Stable Semantics for Extended Disjunctive Programs
 Journal of Logic and Computation
, 1995
"... This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on latticestructured multivalued logics, and are characterized by a new fixpoint semantics of extended disjunctive programs. Applications of the paraconsistent semantics for reasoning in inconsistent programs are also presented. Keywords: Extended disjunctive programs, inconsistency, multivalued logic, paraconsistent stable model semantics. 3 Journal of Logic and Computation 5: 265285, Oxford University Press, 1995. 1 1
On How Agents Make Friends: Mechanisms for Trust Acquisition
, 2001
"... We need models of trust to facilitate cooperation in multiagent systems, where agents, human and artificial, do not know each other beforehand. This paper lists and proposes simple mechanisms for trust acquisition based on a very basic and general definition of trust, making no assumptions on the i ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We need models of trust to facilitate cooperation in multiagent systems, where agents, human and artificial, do not know each other beforehand. This paper lists and proposes simple mechanisms for trust acquisition based on a very basic and general definition of trust, making no assumptions on the internal cognitive models of the involved agents. We also show how trust acquired oneonone can be propagated in a social network of agents.
ModelChecking Infinite StateSpace Systems with FineGrained Abstractions Using SPIN
 In Proceedings of the 8th SPIN Workshop on Model Checking Software, volume 2057 of LNCS
, 2001
"... . In analyzing infinitestate systems, it is often useful to define multiplevalued predicates. Such predicates can determine the (finite) levels of desirability of the current system state and transitions between them. We can capture multiplevalued predicates as elements of a logic defined over ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
. In analyzing infinitestate systems, it is often useful to define multiplevalued predicates. Such predicates can determine the (finite) levels of desirability of the current system state and transitions between them. We can capture multiplevalued predicates as elements of a logic defined over finite total orders (FTOs). In this paper we extend automatatheoretic LTL modelchecking to reasoning about a class of multiplevalued logics. We also show that modelchecking over FTOs is reducible to classical modelchecking, and thus can be implemented in SPIN. 1 Introduction Currently, modelchecking is essentially limited to reasoning about mediumsized finitestate models. Reasoning about large models, especially if these are not finitestate, is typically done using abstraction [CGL94]. Abstraction techniques, such as abstract interpretation [CC77], require the user to supply the mapping between concrete and abstract data types in their models. Predicate abstraction, introduced...