Sciweavers

749 search results - page 26 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ENTCS
2002
144views more  ENTCS 2002»
13 years 9 months ago
Logics and Multi-agents: towards a new symbolic model of cognition
Abstract The last edition of CLIMA, held in 2001 in Paphos (Cyprus) ended with a panel session on the role of Computational Logic (CL) in Multi-Agent Systems (MAS). Two dimensions ...
Paolo Torroni
FOCS
2009
IEEE
14 years 4 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 1 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
BIRTHDAY
2008
Springer
13 years 12 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
Michael Kaminski, Tony Tan
CP
2009
Springer
14 years 10 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...