Person:199227: Difference between revisions

From MaRDI portal
Person:199227
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Domenico Saccà to Domenico Saccà: Duplicate
 
(No difference)

Latest revision as of 03:11, 9 December 2023

Available identifiers

zbMath Open sacca.domenicoWikidataQ102395345 ScholiaQ102395345MaRDI QIDQ199227

List of research outcomes





PublicationDate of PublicationType
The expressive power of ``possible-is-certain semantics (extended abstract)2024-06-21Paper
The pushdown method to optimize chain logic programs2019-01-10Paper
The expressive power of unique total stable model semantics2018-07-04Paper
GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES2015-04-29Paper
A probabilistic framework for estimating the accuracy of aggregate range queries evaluated over histograms2012-10-02Paper
Constraint-Based Mining and Inductive Databases2006-11-13Paper
https://portal.mardi4nfdi.de/entity/Q56996542005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q44732832004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44240042003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44107342003-07-03Paper
https://portal.mardi4nfdi.de/entity/Q47077592003-06-11Paper
Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).2003-01-14Paper
Semi-automatic techniques for deriving interscheme properties from database schemes2002-07-29Paper
A technique for deriving hyponymies and overlappings from database schemes2002-03-03Paper
Extending stratified datalog to capture complexity classes ranging from \(\mathcal P\) to \(Cal Q\mathcal H\)2001-08-26Paper
Expressive power and complexity of partial models for disjunctive deductive databases1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43758221998-03-02Paper
``Possible is certain is desirable and can be expressive1998-01-07Paper
Deterministic and non-deterministic stable models1997-11-04Paper
On the partial semantics for disjunctive deductive databases1997-10-26Paper
Programming with non-determinism in deductive databases1997-10-26Paper
The expressive powers of stable models for bound and unbound DATALOG queries1997-08-03Paper
Matching of bounded set terms in the logic language LDL++1997-06-15Paper
Multiple total stable models are definitely needed to solve unique solution problems1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q49409331997-01-01Paper
Comparison of methods for logic-query implementation1991-01-01Paper
The generalized counting method for recursive logic queries1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37891091988-01-01Paper
Minimal Representation of Directed Hypergraphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37860361986-01-01Paper
Closures of database hypergraphs1985-01-01Paper
Database partitioning in a cluster of processors1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873201985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36877541984-01-01Paper
Graph Algorithms for Functional Dependency Manipulation1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39025521981-01-01Paper

Research outcomes over time

This page was built for person: Domenico Saccà