Sciweavers

1144 search results - page 201 / 229
» Logic programming for combinatorial problems
Sort
View
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 2 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
ENTCS
2006
123views more  ENTCS 2006»
15 years 2 months ago
Nonmonotonic Trust Management for P2P Applications
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management langua...
Marcin Czenko, Ha Tran, Jeroen Doumen, Sandro Etal...
118
Voted
LACL
2001
Springer
15 years 6 months ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat
CACM
1998
110views more  CACM 1998»
15 years 2 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
EPIA
2009
Springer
15 years 9 months ago
An ILP System for Learning Head Output Connected Predicates
Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
José Carlos Almeida Santos, Alireza Tamaddo...