Dino Pedreschi

From MaRDI portal
Revision as of 21:17, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:202170

Available identifiers

zbMath Open pedreschi.dinoDBLPp/DPedreschiWikidataQ102413421 ScholiaQ102413421MaRDI QIDQ202170

List of research outcomes





PublicationDate of PublicationType
European Multilingual News Articles Dataset with Topic Annotation2023-12-17Dataset
Dense Hebbian neural networks: a replica symmetric picture of unsupervised learning2023-09-28Paper
Dense Hebbian neural networks: a replica symmetric picture of supervised learning2023-09-08Paper
Proving termination of general Prolog programs2022-08-16Paper
GLocalX -- from local to global explanations of black box AI models2021-11-02Paper
Data Mining and Constraints: An Overview2021-05-20Paper
Clustering Formulation Using Constraint Optimization2021-05-18Paper
A classification for community discovery methods in complex networks2020-10-14Paper
Discrimination- and privacy-aware patterns2019-01-29Paper
Weakest preconditions for pure Prolog programs2016-06-09Paper
Constraint-Based Mining and Inductive Databases2006-11-13Paper
Program Development in Computational Logic2005-12-23Paper
Bounded nondeterminism of logic programs2005-01-17Paper
On logic programs that always succeed.2004-03-14Paper
Classes of terminating logic programs2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q47077412003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47077612003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q45494082003-02-19Paper
Semantics and expressive power of nondeterministic constructs in deductive databases2002-08-26Paper
Foundations of distributed interaction systems2002-06-27Paper
https://portal.mardi4nfdi.de/entity/Q27671202002-04-28Paper
https://portal.mardi4nfdi.de/entity/Q27297312001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q44992402001-03-05Paper
Verification of logic programs1999-11-01Paper
Datalog with non-deterministic choice computes NDB-PTIME1998-10-04Paper
Verification of meta-interpreters1997-06-10Paper
A closer look at declarative interpretations1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48787741996-05-14Paper
Reasoning about termination of pure Prolog programs1993-12-12Paper
A transformational approach to negation in logic programming1992-06-25Paper
Complete logic programs with domain-closure axiom1988-01-01Paper
Symbolic evaluation with structural recursive symbolic constants1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37733051987-01-01Paper
Symbolic Semantics and Program Reduction1985-01-01Paper

Research outcomes over time

This page was built for person: Dino Pedreschi