Sciweavers

1321 search results - page 64 / 265
» Subtyping in Logical Form
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
15 years 6 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
15 years 4 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
CADE
1998
Springer
15 years 4 months ago
A Resolution Decision Procedure for the Guarded Fragment
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Hans de Nivelle
DALT
2009
Springer
15 years 3 months ago
Social Commitments in Time: Satisfied or Compensated
Abstract. We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We...
Paolo Torroni, Federico Chesani, Paola Mello, Marc...
IGPL
2002
77views more  IGPL 2002»
14 years 11 months ago
On the semantics of informational independence
The semantics of the independence friendly logic of Hintikka and Sandu is usually defined via a game of imperfect information. We give a definition in terms of a game of perfect i...
Jouko A. Väänänen