• 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 19 matches

• 2000
• 
  Sergio Antoy, Michael Hanus:
  Compiling Multi-Paradigm Declarative Programs into Prolog. FroCoS 2000: 171-185
• 
  Alessandro Armando, Silvio Ranise:
  Termination of Constraint Contextual Rewriting. FroCoS 2000: 47-61
• 
  Franz Baader, Cesare Tinelli:
  Combining Equational Theories Sharing Non-Collapse-Free Constructors. FroCoS 2000: 260-274
• 
  Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron:
  Congruence Closure Modulo Associativity and Commutativity. FroCoS 2000: 245-259
• 
  Alexander Bockmayr, Friedrich Eisenbrand:
  Combining Logic and Optimization in Cutting Plane Theory. FroCoS 2000: 1-17
• 
  Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
  Modular Redundancy for Theorem Proving. FroCoS 2000: 186-199
• 
  Alessandro Coglio, Fausto Giunchiglia, José Meseguer, Carolyn L. Talcott:
  Composing and Controlling Search in Reasoning Theories Using Mappings. FroCoS 2000: 200-216
• 
  Jorge Cruz, Pedro Barahona:
  Handling Differential Equations with Constraints for Decision Support. FroCoS 2000: 105-120
• 
  Agostino Dovier, Carla Piazza, Alberto Policriti:
  Comparing Expressiveness of Set Constructor Symbols. FroCoS 2000: 275-289
• 
  Gilles Dowek:
  Axioms vs. Rewrite Rules: From Completeness to Cut Elimination. FroCoS 2000: 62-72
• 
  Laurent Granvilliers:
  Towards Cooperative Interval Narrowing. FroCoS 2000: 18-31
• 
  Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher:
  Normal Forms and Proofs in Combined Modal and Temporal Logics. FroCoS 2000: 73-87
• 
  Paqui Lucio:
  Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic. FroCoS 2000: 88-104
• 
  Erica Melis, Jürgen Zimmer, Tobias Müller:
  Integrating Constraint Solving into Proof Planning. FroCoS 2000: 32-46
• 
  Erik Poll, Simon J. Thompson:
  Integrating Computer Algebra and Reasoning through the Type System of Aldor. FroCoS 2000: 136-150
• 
  Klaus U. Schulz:
  Why Combined Decision Problems Are Often Intractable. FroCoS 2000: 217-244
• 
  Volker Sorge:
  Non-Trivial Symbolic Computations in Proof Planning. FroCoS 2000: 121-135
• 
  Tomás E. Uribe:
  Combinations of Model Checking and Theorem Proving. FroCoS 2000: 151-170
• 
  Hélène Kirchner, Christophe Ringeissen:
  Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings. Lecture Notes in Computer Science 1794, Springer 2000, ISBN 3-540-67281-8 [contents]