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

• 1995
• 
  José Ramón Zubizarreta Aizpuru, Javier Arrieta Usunáriz:
  GA/TS: A Hybrid Approach for Job Shop Scheduling in a Production System. EPIA 1995: 153-164
• 
  José Júlio Alferes, Renwei Li, Luís Moniz Pereira:
  Non-Atomic Actions in the Situation Calculus. EPIA 1995: 273-284
• 
  José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski:
  Belief Revision in Non-Monotonic Reasoning. EPIA 1995: 40-56
• 
  Carlos Bento, Penousal Machado, Ernesto Costa:
  On the Role of Splitting and Merging Past Cases for Generation of a New Solution. EPIA 1995: 249-260
• 
  Pierre Berlandier:
  A Symbiotic Approach to Arc and Path Consistency Checking. EPIA 1995: 107-114
• 
  Sayan Bhattacharyya, Steven L. Lytinen:
  Syntactic and Semantic Filtering in a Chart Parser. EPIA 1995: 465-471
• 
  Sabine Broda, Luís Damas:
  A New Translation Algorithm from Lambda Calculus into Combinatory Logic. EPIA 1995: 359-370
• 
  Núria Castell, Àngels Hernández:
  Filtering Software Specifications Written in Natural Language. EPIA 1995: 447-455
• 
  Nathalie Chaignaud:
  A Cognitive Model of Problem Solving with Incomplete Information. EPIA 1995: 441-445
• 
  Gildas Cherruel, Bassel Solaiman, Yvon Autret:
  Efficient Learning in Multi-Layered Perceptron Using the Grow-And-Learn Algorithm. EPIA 1995: 397-401
• 
  Helder Coelho, Luis Antunes, Luís Moniz:
  Building Multi-Agent Societies from Description to Systems: Inter-Layer Translations. EPIA 1995: 143-152
• 
  Helder Coelho, Augusto Eusébio, Ernesto Costa:
  A Closer Look to Artificial Learning Environments. EPIA 1995: 129-142
• 
  Luís M. M. Custódio, Carlos A. Pinto-Ferreira:
  Agreement: A Logical Approach to Approximate Reasoning. EPIA 1995: 419-428
• 
  Luís Damas, Nelma Moreira:
  Constraint Categorial Grammars. EPIA 1995: 347-358
• 
  Carlos Viegas Damásio, Luís Moniz Pereira:
  A Model Theory for Paraconsistent Logic Programming. EPIA 1995: 377-386
• 
  Ho Ngoc Duc:
  Logical Omniscience vs. Logical Ignorance on a Dilemma of Epistemic Logic. EPIA 1995: 237-248
• 
  Truong Quoc Dung:
  A New Representation of JTMS. EPIA 1995: 57-68
• 
  Uwe Egly:
  Super-Polynomial Speed-Ups in Proof Length by New Tautologies. EPIA 1995: 29-40
• 
  Carmen Fernández-Chamizo, Pedro A. González-Calero, Mercedes Gómez-Albarrán:
  Promoting Software Reuse Through Explicit Knowledge Representations. EPIA 1995: 387-396
• 
  João Gama, Pavel Brazdil:
  Characterization of Classification Algorithms. EPIA 1995: 189-200
• 
  Graça Gaspar, Helder Coelho:
  Where Do Intensions Come from?: A Framework for Goals and Intensions Adoption, Derivation and Evolution. EPIA 1995: 115-127
• 
  Nikos I. Karacapilidis:
  Planning Under Uncertainty: A Qualitative Approach. EPIA 1995: 285-296
• 
  Bernhard Kipper:
  Interlocking Multi-Agent and Blackboard Architectures. EPIA 1995: 371-375
• 
  Slavko Krajcar, Davor Skrlec, Branko Pribicevic, Snjezana Blagajac:
  GA Approach to Solving Multiple Vehicle Routing Problem. EPIA 1995: 473-481
• 
  Jong-Hyeok Lee, Gary Geunbae Lee:
  A Dependency Parser of Korean Based on Connectionist/ Symbolic Techniques. EPIA 1995: 95-106
• 
  Pedro U. Lima, George N. Saridis:
  Using Stochastic Grammars to Learn Robotic Tasks. EPIA 1995: 335-346
• 
  Pedro A. de Matos, João P. Martins:
  Parsimonious Diagnosis in SNePS. EPIA 1995: 457-463
• 
  Chris McConnell:
  Minimal Model Complexity Search. EPIA 1995: 177-187
• 
  Erica Melis:
  Theorem Proving by Analogy - A Compelling Example. EPIA 1995: 261-272
• 
  Nadia Messaoudi:
  Constructing Extensions by Resolving a System of Linear Equations. EPIA 1995: 429-433

skipping 16 more matches