• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

• 1994
• 
  Chitta Baral:
  Varying Selection Functions to Relate Conditional Logics and Preferential Models. Fundam. Informaticae 21(4): 307-319 (1994)
• 
  Leopoldo E. Bertossi, Raymond Reiter:
  Circumscription and Generic Mathematical Objects. Fundam. Informaticae 21(1/2): 113-123 (1994)
• 
  Philippe Besnard, Torsten Schaub:
  Possible Worlds Semantics for Default Logics. Fundam. Informaticae 21(1/2): 39-66 (1994)
• 
  Mark S. Boddy, Robert P. Goldman, Keiji Kanazawa, Lynn Andrea Stein:
  A Critical Examination of Model Preference Defaults. Fundam. Informaticae 21(1/2): 23-38 (1994)
• 
  Symeon Bozapalidis:
  Representable Tree Series. Fundam. Informaticae 21(4): 367-389 (1994)
• 
  Marco Cadoli, Marco Schaerf:
  Approximate Inference in Default Logic and Circumscription. Fundam. Informaticae 21(1/2): 103-112 (1994)
• 
  Jianhua Chen:
  The Logic of Only Knowing as a Unified Framework for Non-Monotonic Reasoning. Fundam. Informaticae 21(3): 205-220 (1994)
• 
  Peter Cholak, Howard A. Blair:
  The Complexity of Local Stratification. Fundam. Informaticae 21(4): 333-344 (1994)
• 
  Heng Chu, David A. Plaisted:
  Model Finding in Semantically Guided Instance-Based Theorem Proving. Fundam. Informaticae 21(3): 221-235 (1994)
• 
  Ivo Düntsch:
  Rough Relation Algebras. Fundam. Informaticae 21(4): 321-331 (1994)
• 
  David W. Etherington, Henry A. Kautz, Kurt Konolige:
  Introduction to the Special Issue. Fundam. Informaticae 21(1/2): 1-5 (1994)
• 
  Matthew L. Ginsberg, Hugh W. Holbrook:
  What Defaults can do that Hierarchies Can't. Fundam. Informaticae 21(1/2): 149-159 (1994)
• 
  Hardi Hungar:
  Expressibility of the Semantics of Sequential Programs in First-Order Logic. Fundam. Informaticae 21(4): 345-365 (1994)
• 
  Henryk Jan Komorowski, Zbigniew W. Ras:
  Guest Editors' Preface - Selected Papers from the ISMIS'93 Symposium. Fundam. Informaticae 21(3): 161-162 (1994)
• 
  Nicola Leone, Luigi Palopoli, Massimo Romeo:
  Modifying Intensional Logic Knowledge. Fundam. Informaticae 21(3): 183-203 (1994)
• 
  L. Thorne McCarty:
  Defeasible Deontic Reasoning. Fundam. Informaticae 21(1/2): 125-148 (1994)
• 
  Louise E. Moser, P. M. Melliar-Smith, George Kutty, Y. S. Ramakrishna:
  Completeness and Soundness of Axiomatizations for Temporal Logics. Without Next. Fundam. Informaticae 21(4): 257-305 (1994)
• 
  Mikhail Moshkov:
  Optimization Problems for Decision Trees. Fundam. Informaticae 21(4): 391-401 (1994)
• 
  Neil V. Murray, Erik Rosenthal:
  Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. Fundam. Informaticae 21(3): 237-253 (1994)
• 
  Halina Przymusinska, Teodor C. Przymusinski:
  Stationary Default Extensions. Fundam. Informaticae 21(1/2): 67-87 (1994)
• 
  David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy:
  Expressing Program Requirements Using Refinement Lattices. Fundam. Informaticae 21(3): 163-182 (1994)
• 
  Camilla Schwind, Pierre Siegel:
  A Modal Logic for Hypothesis Theory. Fundam. Informaticae 21(1/2): 89-101 (1994)
• 
  Robert Stalnaker:
  What is a Nonmonotonic Consequence Relation? Fundam. Informaticae 21(1/2): 7-21 (1994)