Sciweavers

579 search results - page 96 / 116
» Combined reasoning by automated cooperation
Sort
View
LPAR
2001
Springer
13 years 12 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
LLL
1999
Springer
13 years 11 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec
ICLP
1997
Springer
13 years 11 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
KR
1992
Springer
13 years 11 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
ICLP
2010
Springer
13 years 11 months ago
Models for Trustworthy Service and Process Oriented Systems
Abstract. Service and process-oriented systems promise to provide more effective business and work processes and more flexible and adaptable enterprise IT systems. However, the t...
Hugo A. López