Sciweavers

57 search results - page 11 / 12
» Compiling propositional weighted bases
Sort
View
CADE
2011
Springer
12 years 6 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
AGP
1995
IEEE
13 years 9 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
FSMNLP
2005
Springer
13 years 11 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller
IJCNN
2008
IEEE
14 years 17 days ago
Learning associations of conjuncted fuzzy sets for data prediction
— Fuzzy Associative Conjuncted Maps (FASCOM) is a fuzzy neural network that represents information by conjuncting fuzzy sets and associates them through a combination of unsuperv...
Hanlin Goh, Joo-Hwee Lim, Chai Quek
ARTMED
2010
119views more  ARTMED 2010»
13 years 6 months ago
Fuzzy Arden Syntax: A fuzzy programming language for medicine
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
Thomas Vetterlein, Harald Mandl, Klaus-Peter Adlas...