Found: 8
Select item for more details and to access through your institution.
Relaxed Notions of Schema Mapping Equivalence Revisited.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 3, p. 483, doi. 10.1007/s00224-012-9397-0
- By:
- Publication type:
- Article
Normalization and optimization of schema mappings.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2011, v. 20, n. 2, p. 277, doi. 10.1007/s00778-011-0226-x
- By:
- Publication type:
- Article
Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
- Published in:
- Theory & Practice of Logic Programming, 2014, v. 14, n. 2, p. 141, doi. 10.1017/S1471068412000099
- By:
- Publication type:
- Article
Implementing Courcelle's Theorem in a declarative framework for dynamic programming.
- Published in:
- Journal of Logic & Computation, 2017, v. 27, n. 4, p. 1067, doi. 10.1093/logcom/exv089
- By:
- Publication type:
- Article
The complexity of handling minimal solutions in logic-based abduction.
- Published in:
- Journal of Logic & Computation, 2015, v. 25, n. 3, p. 805, doi. 10.1093/logcom/exu053
- By:
- Publication type:
- Article
Model Representation over Finite and Infinite Signatures.
- Published in:
- Journal of Logic & Computation, 2007, v. 17, n. 3, p. 453, doi. 10.1093/logcom/exm008
- By:
- Publication type:
- Article
DO HARD SAT-RELATED REASONING TASKS BECOME EASIER IN THE KROM FRAGMENT?
- Published in:
- Logical Methods in Computer Science (LMCS), 2018, v. 14, n. 4, p. 1, doi. 10.23638/LMCS-14(4:10)2018
- By:
- Publication type:
- Article
Limits of Schema Mappings.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 4, p. 899, doi. 10.1007/s00224-017-9812-7
- By:
- Publication type:
- Article