Fundamenta Informaticae, Volume 48

Volume 48, Number 1, October-November 2001

• Joscha Bach:
  Supporting Textual Input by Using Multiple Entropy Models. 1-7
  
• Pierluigi Frisco, Claudio Zandron:
  On Variants of Communicating Distributed H Systems. 9-20
  
• Maciej Koutny, Giuseppe Pappalardo:
  Behaviour Abstraction for Communicating Sequential Processes. 21-54
  
• Alexander Meduna, Petr Vurm:
  Multisequential Grammars with Homogeneous Selectors. 55-60
  
• Nguyen Hung Son:
  On Efficient Handling of Continuous Attributes in Large Data Bases. 61-81
  
• George Tourlakis:
  Computability in Type-2 Objects with Well-Behaved Type-1 Oracles is p-Normal. 83-91
  
• Xishun Zhao, Decheng Ding:
  Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. 93-106
  

Volume 48, Number 2-3, November 2001

• Jan Broersen, Roel Wieringa, John-Jules Ch. Meyer:
  A Fixed-point Characterization of a Deontic Logic of Regular Action. 107-128
  
• José Carmo, Olga Pacheco:
  Deontic and Action Logics for Organized Collective Agency, Modeled through Institutionalized Agents and Roles. 129-163
  José Carmo, Robert Demolombe, Andrew J. I. Jones: An Application of Deontic Logic to Information System Constraints. 165-181
• Laurence Cholvy, Christophe Garion:
  An Attempt to Adapt a Logic of Conditional Preferences for Reasoning with Contrary-To-Duties. 183-204
  
• Jörg Hansen:
  Sets, Sentences, and Some Logics about Imperatives. 205-226
  
• Ray E. Jennings:
  Natural Frames and Self-dual Logics. 227-236
  
• Xavier Parent:
  Cumulativity, Identity and Time in Deontic Logic. 237-252
  
• Henry Prakken:
  Modelling Defeasibility in Law: Logic or Procedure? 253-271
  
• Marek J. Sergot, Fiona Richards:
  On the Representation of Action and Agency in the Theory of Normative Positions. 273-293
  

Volume 48, Number 4, December 2001

• Ngoc Thanh Nguyen:
  Using Distance Functions to Solve Representation Choice Problems. 295-314
  
• Franz Puntigam, Christof Peter:
  Types for Active Objects with Static Deadlock Prevention. 315-341
  
• Hiroshi Sakai:
  Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems. 343-362
  
• Zbigniew Stachniak:
  Non-Clausal Reasoning with Definite Theories. 363-388
  
• Jerzy Tyszkiewicz:
  Computability by Sequences of Queries. 389-414
  

Last update Tue Feb 14 04:18:00 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page