Sciweavers

2611 search results - page 366 / 523
» A Logic for Concepts and Similarity
Sort
View
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 6 months ago
A Generic Analysis Environment for Curry Programs
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
Michael Hanus
AMAI
2000
Springer
15 years 6 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
NDJFL
1998
105views more  NDJFL 1998»
15 years 6 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
LPAR
2012
Springer
14 years 2 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
ICSE
2007
IEEE-ACM
16 years 6 months ago
Modeling in Software Engineering
A data model is a plan for building a database and is comparable to an architect's building plans. There are two major methodologies used to create a data model: the EntityRe...
Joanne M. Atlee, Robert B. France, Geri Georg, Ana...