Sciweavers

947 search results - page 76 / 190
» Declarative Programming in Prolog
Sort
View
OOPSLA
2004
Springer
15 years 3 months ago
Super and inner: together at last!
In an object-oriented language, a derived class may declare a method with the same signature as a method in the base class. The meaning of the re-declaration depends on the langua...
David S. Goldberg, Robert Bruce Findler, Matthew F...
CMOT
1998
92views more  CMOT 1998»
14 years 9 months ago
SDML: A Multi-Agent Language for Organizational Modelling
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
Scott Moss, Helen Gaylard, Steve Wallis, Bruce Edm...
COLT
1992
Springer
15 years 1 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ISMIS
1994
Springer
15 years 1 months ago
Reasoning About the Safety of Information: From Logical Formalization to Operational Definition
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
Laurence Cholvy, Robert Demolombe, Andrew J. I. Jo...
AGP
1998
IEEE
15 years 2 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...