Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Philippe Balbiani

Papers on DiSC'04


On the Consistency Problem for the INDU Calculus

Publications


Note: Links lead to the DBLP on the Web.

Philippe Balbiani

Anas Abou El Kalam , Salem Benferhat , Alexandre Miège , Rania El Baida , Frédéric Cuppens , Claire Saurel , Philippe Balbiani, Yves Deswarte , Gilles Trouessin : Organization based access contro. POLICY 2003 : 120-

Philippe Balbiani, Jean-François Condotta , Gerard Ligozat : Reasoning about Cyclic Space: Axiomatic and Computational Aspects. Spatial Cognition 2003 : 348-371

Philippe Balbiani, Jean-François Condotta , Gerard Ligozat : On the Consistency Problem for the INDU Calculus. TIME 2003 : 203-211

Philippe Balbiani: Eliminating Unorthodox Derivation Rules in an Axiom System for Iteration-free PDL with Intersection. Fundam. Inform. 56 (3): 211-242 (2003)

Luis Fariñas del Cerro , Philippe Balbiani, Andreas Herzig : Foreword. Journal of Applied Non-Classical Logics 13 (1): 7-8 (2003)

Philippe Balbiani, Jean-François Condotta : Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning. FroCos 2002 : 162-176

Philippe Balbiani, Jean-François Condotta : Spatial Reasoning About Points in a Multidimensional Setting. Appl. Intell. 17 (3): 221-238 (2002)

Philippe Balbiani, Dimiter Vakarelov : A Modal Logic for Indiscernibility and Complementarity in Information Systems. Fundam. Inform. 50 (3-4): 243-263 (2002)

Philippe Balbiani, Jean-François Condotta , Luis Fariñas del Cerro : Tractability Results in the Block Algebra. J. Log. Comput. 12 (5): 885-909 (2002)

Philippe Balbiani: Foreword. Journal of Applied Non-Classical Logics 12 (3-4): 317-318 (2002)

Philippe Balbiani, Valentin Goranko : Modal Logics for Parallelism, Orthogonality, and Affine Geometries. Journal of Applied Non-Classical Logics 12 (3-4): 365-398 (2002)

Philippe Balbiani, Dimiter Vakarelov : First-Order Characterization and Modal Analysis of Indiscernibility and Complementarity in Information Systems. ECSQARU 2001 : 772-781

Philippe Balbiani: Emptiness Relations in Property Systems. RelMiCS 2001 : 15-34

Philippe Balbiani, Dimiter Vakarelov : Iteration-free PDL with Intersection: a Complete Axiomatization. Fundam. Inform. 45 (3): 173-194 (2001)

Philippe Balbiani, Aomar Osmani : A Model for Reasoning about Topologic Relations between cyclic intervals. KR 2000 : 378-385

Philippe Balbiani, Jean-François Condotta , Gerard Ligozat : Reasoning about Generalized Intervals: Horn Representability and Tractability. TIME 2000 : 23-30

Philippe Balbiani, Jean-François Condotta , Luis Fariñas del Cerro : A Tractable Subclass of the Block Algebra: Constraint Propagation and Preconvex Relations. EPIA 1999 : 75-89

Philippe Balbiani, Jean-François Condotta , Luis Fariñas del Cerro : A New Tractable Subclass of the Rectangle Algebra. IJCAI 1999 : 442-447

Philippe Balbiani, Ewa Orlowska : A hierarchy of modal logics with relative accessibility relations. Journal of Applied Non-Classical Logics 9 (2-3): (1999)

Philippe Balbiani: Inequality without irreflexivity. Journal of Applied Non-Classical Logics 9 (4): (1999)

Philippe Balbiani, Jean-François Condotta , Luis Fariñas del Cerro , Aomar Osmani : Reasoning about Generalized Intervals. AIMSA 1998 : 50-61

Philippe Balbiani, Jean-François Condotta , Luis Fariñas del Cerro : A Model for Reasoning about Bidemsional Temporal Relations. KR 1998 : 124-130

Philippe Balbiani, Dimiter Vakarelov : Extending arrow logic. RelMiCS 1998 : 13-17

Philippe Balbiani: The modal multilogic of geometry. Journal of Applied Non-Classical Logics 8 (3): (1998)

Philippe Balbiani, Luis Fariñas del Cerro : Complete axiomatization of a relative modal logic with composition and intersection. Journal of Applied Non-Classical Logics 8 (4): (1998)

Philippe Balbiani, Stéphane Demri : Prefixed Tableaux Systems for Modal Logics with Enriched Languages. IJCAI (1) 1997 : 190-195

Philippe Balbiani, Luis Fariñas del Cerro , Tinko Tinchev , Dimiter Vakarelov : Modal Logics for Incidence Geometries. J. Log. Comput. 7 (1): 59-78 (1997)

Philippe Balbiani: Modal Logics with Relative Accessibility Relations. FAPR 1996 : 29-42

Philippe Balbiani, Luis Fariñas del Cerro , Tinko Tinchev , Dimiter Vakarelov : Geometrical Structures and Modal Logic. FAPR 1996 : 43-57

Philippe Balbiani: A Modal Logic for Data Analysis. MFCS 1996 : 167-179

Philippe Balbiani: Equation Solving in Projective Planes and Planar Ternary Rings. ALP 1994 : 95-113

Philippe Balbiani: Equation Solving in Geometrical Theories. CTRS 1994 : 31-50

Philippe Balbiani, Andreas Herzig : A translation from the modal logic of provability into K4. Journal of Applied Non-Classical Logics 4 (1): (1994)

Philippe Balbiani, Luis Fariñas del Cerro : Affine Geometry of Collinearity and Conditional Term Rewriting. Term Rewriting 1993 : 196-213

Philippe Balbiani: The Finiteness of Logic Programming Derivations. ALP 1992 : 403-419

Philippe Balbiani: A modal semantics of negation in logic programming. Fundam. Inform. 16 (3-4): 231-262 (1992)

Philippe Balbiani, Andreas Herzig , Mamede Lima Marques : TIM: The Toulouse Inference Machine for Non-Classical Logic Programming. PDK 1991 : 366-382

Philippe Balbiani: A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules. STACS 1991 : 523-534

Philippe Balbiani: Modal Logic and Negation as Failure. J. Log. Comput. 1 (3): 331-356 (1991)

Philippe Balbiani: Non-monotonic Reasoning and Modal Logic, from Negation as Failure to Default Logic. IPMU 1990 : 223-231

Philippe Balbiani, Luis Fariñas del Cerro , Andreas Herzig : Declarative Semantics for Modal Logic Programs. FGCS 1988 : 507-514

1 [ 41 ]

2 [ 41 ]

3 [ 1 ] [ 8 ] [ 13 ] [ 15 ] [ 17 ] [ 20 ] [ 21 ] [ 24 ] [ 25 ] [ 33 ] [ 37 ]

4 [ 20 ] [ 21 ] [ 24 ] [ 25 ] [ 26 ] [ 33 ] [ 35 ] [ 36 ] [ 39 ] [ 40 ]

5 [ 41 ]

6 [ 16 ]

7 [ 41 ]

8 [ 31 ]

9 [ 1 ] [ 5 ] [ 9 ] [ 37 ]

10 [ 41 ]

11 [ 26 ] [ 39 ] [ 40 ]

12 [ 5 ]

13 [ 41 ]

14 [ 23 ]

15 [ 21 ] [ 27 ]

16 [ 41 ]

17 [ 13 ] [ 15 ]

18 [ 41 ]

19 [ 13 ] [ 15 ] [ 19 ] [ 28 ] [ 30 ] [ 34 ]




©2004 Association for Computing Machinery