Results 1  10
of
685
A Taxonomy for Ensuring Institutional Compliance in Utility Computing
"... A modal logic for reasoning on consistency and completeness of regulations ..."
Abstract
 Add to MetaCart
A modal logic for reasoning on consistency and completeness of regulations
A Scheme for Integrating Concrete Domains into Concept Languages
, 1991
"... A drawback which concept languages based on klone have is that all the terminological knowledge has to be defined on an abstract logical level. In many applications, one would like to be able to refer to concrete domains and predicates on these domains when defining concepts. Examples for such conc ..."
Abstract

Cited by 280 (22 self)
 Add to MetaCart
extension by some specific concrete domain. We shall define a terminological and an assertional language, and consider the important inference problems such as subsumption, instantiation, and consistency. The formal semantics as well as the reasoning algorithms are given on the scheme level. In contrast
A Logic for Reasoning with Inconsistency
, 1992
"... Most known computational approaches to reasoning have problems when facing inconsistency, so they assume that a given logical system is consistent. Unfortunately, the latter is difficult to verify and very often is not true. It may happen that addition of data to a large system makes it inconsistent ..."
Abstract

Cited by 110 (8 self)
 Add to MetaCart
Most known computational approaches to reasoning have problems when facing inconsistency, so they assume that a given logical system is consistent. Unfortunately, the latter is difficult to verify and very often is not true. It may happen that addition of data to a large system makes
Nonmonotonic logic II: nonmonotonic modal theories
 Journal of the ACM
, 1982
"... ABSTRACT Tradmonal logics suffer from the "monotomclty problem"' new axioms never mvahdate old theorems One way to get nd of this problem ts to extend traditional modal logic in the following way The operator M (usually read "possible") is extended so that Mp is true whenev ..."
Abstract

Cited by 104 (1 self)
 Add to MetaCart
whenever p is consistent with the theory Then any theorem of this form may be mvahdated if ~p ~s added as an axiom This extension results m nonmonotomc versions of the systems T, $4, and $5 These systems are complete in that a theorem is provable in a theory based on one of them just if it is true m all
Abstract Context Logic as Modal Logic: Completeness and Parametric Inexpressivity Separation Logic, Ambient Logic and Context Logic are based on a
"... similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) for reasoning hypothetically about data. We show how to interpret these structural connectives as modalities in M ..."
Abstract
 Add to MetaCart
similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) for reasoning hypothetically about data. We show how to interpret these structural connectives as modalities
Abstract Context Logic as Modal Logic: Completeness and Parametric Inexpressivity Separation Logic, Ambient Logic and Context Logic are based on a
"... similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) for reasoning hypothetically about data. We show how to interpret these structural connectives as modalities in M ..."
Abstract
 Add to MetaCart
similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) for reasoning hypothetically about data. We show how to interpret these structural connectives as modalities
Failure of Interpolation in Combined Modal Logics
 Journal of Formal Logic
, 1998
"... We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation. The same holds for combinations by taking unions, a generalization of Humberstone’s inaccessibility lo ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
paper, interpolation has become one of the standard properties that one investigates when designing a logic, though it hasn’t received the status of a completeness or a decidability theorem. One of the main reasons why a logic should have interpolation is because of “modular theory building”. As we
Axiomatising NashConsistent Coalition Logic
 ILLC, University of Amsterdam
, 2002
"... We add a rule for Nashconsistency to Coalition Logic, a modal logic for reasoning about the abilities and rights of groups in multiagent systems. Rights of agents (constitutions) can be formalised using Coalition Logic, and the additional inference rule of Nashconsistency will guarantee that any m ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We add a rule for Nashconsistency to Coalition Logic, a modal logic for reasoning about the abilities and rights of groups in multiagent systems. Rights of agents (constitutions) can be formalised using Coalition Logic, and the additional inference rule of Nashconsistency will guarantee that any
A Modal ActiveLogic with Focus of Attention for Reasoning in Time
, 1997
"... Real agents must work within the limitations or bounds imposed by their environment and by their own makeup. Among the resources available only in limited quantities are time, space, and information. Most formal attempts to model agents assume that an agent is able to reason forever in a timeless pr ..."
Abstract
 Add to MetaCart
: limitation of reasoning, awareness of external events and the possibility of inconsistency of knowledge bases. The semantics we use are based upon the Montague semantics. We present a sound and complete framework for a bounded agent with these properties.
Results 1  10
of
685