Sciweavers

1391 search results - page 140 / 279
» Completeness of Neighbourhood Logic
Sort
View
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 10 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
ECAI
2010
Springer
13 years 10 months ago
A Unified Framework for Non-standard Reasoning Services in Description Logics
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
ACS
2005
13 years 9 months ago
Relating Categorical Semantics for Intuitionistic Linear Logic
There are several kinds of linear typed calculus in the literature, some with their associated notion of categorical model. Our aim in this paper is to systematise the relationshi...
Maria Emilia Maietti, Paola Maneggia, Valeria de P...
JANCL
2007
115views more  JANCL 2007»
13 years 9 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
IJAR
2010
91views more  IJAR 2010»
13 years 7 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens