Sciweavers

CL
2000
Springer
13 years 8 months ago
Proving Failure in Functional Logic Programs
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
Francisco Javier López-Fraguas, Jaime S&aac...
CL
2000
Springer
13 years 8 months ago
Multi-dimensional Dynamic Logic Programming
This paper explores the applicability of the new paradigm of Multi-dimensional Dynamic Logic Programming to represent an agent’s view of the combination of societal knowledge dyn...
João Alexandre Leite, José Jú...
CL
2000
Springer
13 years 8 months ago
Reasoning about Duplicate Elimination with Description Logic
Vitaliy L. Khizder, David Toman, Grant E. Weddell
CL
2000
Springer
13 years 8 months ago
Better Communication for Tighter Cooperation
We propose a general scheme for the cooperation of different constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between...
Petra Hofstedt
CL
2000
Springer
13 years 8 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
CL
2000
Springer
13 years 8 months ago
A Logic Programming Application for the Analysis of Spanish Verse
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...
Pablo Gervás
CL
2000
Springer
13 years 8 months ago
A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases
Abstract. In this paper a semantic approach for the specification and the management of databases with evolving schemata is introduced. It is shown how a general object-oriented m...
Enrico Franconi, Fabio Grandi, Federica Mandreoli
CL
2000
Springer
13 years 8 months ago
Databases and Higher Types
Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be ...
Melvin Fitting
CL
2000
Springer
13 years 8 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren