Sciweavers

2540 search results - page 460 / 508
» Abstract Logics as Dialgebras
Sort
View
AMAI
2000
Springer
13 years 9 months ago
A prospective on mathematics and artificial intelligence: Problem solving=Modeling+Theorem proving
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
Harvey J. Greenberg
CACM
1998
110views more  CACM 1998»
13 years 8 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
NDJFL
1998
105views more  NDJFL 1998»
13 years 8 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
BIRTHDAY
2010
Springer
13 years 8 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
ECOOP
1999
Springer
14 years 1 months ago
Towards Automatic Specialization of Java Programs
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...