Sciweavers

947 search results - page 100 / 190
» Declarative Programming in Prolog
Sort
View
PPPJ
2006
ACM
15 years 3 months ago
Cost and benefit of rigorous decoupling with context-specific interfaces
In Java programs, classes are coupled to each other through the use of typed references. In order to minimize coupling without changing the executed code, interfaces can be introd...
Florian Forster
EPIA
2003
Springer
15 years 3 months ago
A Methodology to Create Ontology-Based Information Retrieval Systems
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
José Saias, Paulo Quaresma
JLP
2008
91views more  JLP 2008»
14 years 9 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen
LPAR
2001
Springer
15 years 2 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...
ANLP
1994
155views more  ANLP 1994»
14 years 11 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier