Follow
Dariusz Kalociński
Dariusz Kalociński
Research Assistant at the Institute of Computer Science, Polish Academy of Sciences
Verified email at ipipan.waw.pl - Homepage
Title
Cited by
Cited by
Year
Semantics of the Barwise sentence: insights from expressiveness, complexity and inference
D Kalociński, MT Godziszewski
Linguistics and Philosophy 41, 423-455, 2018
82018
Quantifier Learning: An Agent-based Coordination Model.
D Kalocinski, N Gierasimczuk, M Mostowski
AAMAS, 1853-1854, 2015
42015
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order
N Bazhenov, D Kalociński, M Wrocławski
39th International Symposium on Theoretical Aspects of Computer Science …, 2022
32022
On unstable and unoptimal prediction
D Kalociński, T Steifer
Mathematical Logic Quarterly 65 (2), 218-227, 2019
32019
An almost perfectly predictable process with no optimal predictor
D Kalociński, T Steifer
2019 IEEE International Symposium on Information Theory (ISIT), 2504-2508, 2019
32019
Convexity and Monotonicity in Language Coordination: Simulating the Emergence of Semantic Universals in Populations of Cognitive Agents
N Gierasimczuk, D Kalociński, F Rakowski, J Uszyński
Journal of Logic, Language and Information 32 (4), 569-600, 2023
22023
Generalization of Shapiro’s theorem to higher arities and noninjective notations
D Kalociński, M Wrocławski
Archive for Mathematical Logic 62 (1), 257-288, 2023
22023
Interactive semantic alignment model: Social influence and local transmission bottleneck
D Kalociński, M Mostowski, N Gierasimczuk
Journal of Logic, Language and Information 27, 225-253, 2018
22018
Learning the semantics of natural language quantifiers
D Kalociński
22016
Degree spectra, and relative acceptability of notations
N Bazhenov, D Kalociński
31st EACSL Annual Conference on Computer Science Logic (CSL 2023), 2023
12023
Some remarks on least moduli
D Kalociński
Fundamenta Informaticae 164 (4), 345-358, 2019
12019
Learnability Thesis Does Not Entail Church's Thesis
M Czarnecki, MT Godziszewski, D Kalociński
10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary …, 2014
12014
Degrees of relations on canonically ordered natural numbers and integers
N Bazhenov, D Kalociński, M Wrocławski
2023
Correction to: Generalization of Shapiro’s theorem to higher arities and noninjective notations
D Kalociński, M Wrocławski
Archive for Mathematical Logic 62 (1), 289-290, 2023
2023
Relatively acceptable notation
N Bazhenov, D Kalociński
arXiv preprint arXiv:2205.00791, 2022
2022
Environmental constraints in the evolution of scalar concepts: Road to'most'
D Kalociński
2018
On Computability and Learnability of the Pumping Lemma Function
D Kalociński
International Conference on Language and Automata Theory and Applications …, 2014
2014
Scalar language under communicative pressure: Road to “most”
D Kalociński
BOOK OF ABSTRACTS, 488, 0
The system can't perform the operation now. Try again later.
Articles 1–18