| Nome |
# |
|
An EPIDOC ontological perspective: The epigraphs of the Castello Ursino Civic museum of Catania via CIDOC CRM, file dfe4d229-fb53-bb0a-e053-d805fe0a78d9
|
48
|
|
A C++ reasoner for the description logic DL4;× D?, file dfe4d228-6c83-bb0a-e053-d805fe0a78d9
|
21
|
|
A tool to easing the configuration and deploying process of Hyperledger Fabric, file fb94c2be-c02d-4726-b58e-431050c07d07
|
21
|
|
Distant reading through ontologies: The case study of catania's benedictines monastery, file dfe4d228-6292-bb0a-e053-d805fe0a78d9
|
16
|
|
OntoCeramic: an OWL ontology for ceramics classification, file dfe4d22b-1c59-bb0a-e053-d805fe0a78d9
|
15
|
|
Efficient string-matching allowing for non-overlapping inversions, file dfe4d227-06a7-bb0a-e053-d805fe0a78d9
|
13
|
|
The satisfiability problem for boolean set theory with a choice correspondence, file dfe4d228-5d47-bb0a-e053-d805fe0a78d9
|
12
|
|
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns, file dfe4d227-8412-bb0a-e053-d805fe0a78d9
|
11
|
|
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach, file dfe4d227-0697-bb0a-e053-d805fe0a78d9
|
10
|
|
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics, file dfe4d227-6720-bb0a-e053-d805fe0a78d9
|
9
|
|
Decision algorithms for fragments of real analysis. I. Continuous
functions with strict convexity and concavity predicates, file dfe4d227-9ea8-bb0a-e053-d805fe0a78d9
|
9
|
|
Bit-Layers Text Encoding for Efficient Text Processing, file dfe4d22e-09ac-bb0a-e053-d805fe0a78d9
|
9
|
|
Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator, file 58cdf99a-1ef0-448a-aaf3-b7807cb504ac
|
8
|
|
(m,n)-rationalizable choices, file dfe4d227-00e6-bb0a-e053-d805fe0a78d9
|
8
|
|
A set-theoretic approach to ABox reasoning services, file dfe4d22d-68ff-bb0a-e053-d805fe0a78d9
|
8
|
|
Choice resolutions, file dfe4d22e-2829-bb0a-e053-d805fe0a78d9
|
8
|
|
An ontology for the iconographic sources of la divina commedia, file dfe4d22e-282d-bb0a-e053-d805fe0a78d9
|
8
|
|
Shape-preserving pattern matching, file dfe4d22d-e7e4-bb0a-e053-d805fe0a78d9
|
7
|
|
The Decision Problem for a Three-sorted Fragment of Set Theory with Restricted Quantification and Finite Enumerations., file dfe4d227-2659-bb0a-e053-d805fe0a78d9
|
6
|
|
Conjunctive Query Answering via a Fragment of Set Theory, file dfe4d227-4c7a-bb0a-e053-d805fe0a78d9
|
6
|
|
An OWL framework for rule-based recognition of places in Italian non-structured text, file dfe4d227-6a7a-bb0a-e053-d805fe0a78d9
|
6
|
|
Polynomial-time satisfiability tests for Boolean fragments of set theory, file dfe4d22d-6a8c-bb0a-e053-d805fe0a78d9
|
6
|
|
Does every recursively enumerable set admit a finite-fold Diophantine representation?, file dfe4d22d-0d66-bb0a-e053-d805fe0a78d9
|
5
|
|
A variant of Turing machines with no control states and its connection to bounded temporal memory, file dfe4d22d-0d67-bb0a-e053-d805fe0a78d9
|
5
|
|
A potential-based variant of the Bellman-Ford algorithm, file dfe4d22d-6a8a-bb0a-e053-d805fe0a78d9
|
5
|
|
Polynomial-time satisfiability tests for ’small’ membership theories, file dfe4d22d-6a8b-bb0a-e053-d805fe0a78d9
|
5
|
|
Sequence searching allowing for non-overlapping adjacent unbalanced translocations, file dfe4d22e-0b4c-bb0a-e053-d805fe0a78d9
|
5
|
|
From Hilbert's 10th problem to slim, undecidable fragments of set theory, file dfe4d22e-1508-bb0a-e053-d805fe0a78d9
|
5
|
|
A decidable theory of differentiable functions with convexities and concavities on real intervals, file dfe4d22e-2062-bb0a-e053-d805fe0a78d9
|
5
|
|
A quadratic reduction of constraints over nested sets to purely boolean formulae in CNF, file dfe4d22e-2ada-bb0a-e053-d805fe0a78d9
|
5
|
|
Rationalization of indecisive choice behavior by pluralist ballots, file f96f4f95-8705-4c34-8643-9daf185f7b3c
|
5
|
|
Complexity assessments for decidable fragments of Set Theory. III Testers for Crucial, Polynomial-Maximal Decidable Boolean Languages, file 6b396212-2ec0-45d6-9400-c2c35af0069f
|
4
|
|
Improved and Self-Tuned Occurrence Heuristics, file dfe4d227-80ce-bb0a-e053-d805fe0a78d9
|
4
|
|
Text searching allowing for inversions and translocations of factors, file dfe4d227-810a-bb0a-e053-d805fe0a78d9
|
4
|
|
Can a single equation witness that every r.e. set admits a finite-fold Diophantine representation?, file dfe4d22d-0bae-bb0a-e053-d805fe0a78d9
|
4
|
|
Encoding sets as real numbers, file dfe4d22d-6900-bb0a-e053-d805fe0a78d9
|
4
|
|
Banishing ultrafilters from our consciousness, file dfe4d22d-f55d-bb0a-e053-d805fe0a78d9
|
4
|
|
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts, file dfe4d227-7ae2-bb0a-e053-d805fe0a78d9
|
3
|
|
An efficient approximate algorithm for the 1-median problem in metric spaces, file dfe4d227-9912-bb0a-e053-d805fe0a78d9
|
3
|
|
An Introduction to the Technique of Formative Processes in Set Theory, file dfe4d22c-88fa-bb0a-e053-d805fe0a78d9
|
3
|
|
A Set-theoretic Approach to Reasoning Services for the Description Logic ; D 4,×, file dfe4d22e-2063-bb0a-e053-d805fe0a78d9
|
3
|
|
The ontology for agents, systems and integration of services: OASIS version 2, file 79d1c8ed-0cad-4bb4-93a5-6dc76c3160e3
|
2
|
|
Web Ontology Representation and Reasoning via Fragments of Set Theory, file dfe4d227-4c09-bb0a-e053-d805fe0a78d9
|
2
|
|
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts, file dfe4d227-563f-bb0a-e053-d805fe0a78d9
|
2
|
|
An Efficient Algorithm for δ-Approximate-Matching with α-Bounded Gaps in Musical Sequences, file dfe4d227-5dbb-bb0a-e053-d805fe0a78d9
|
2
|
|
A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation, file dfe4d227-629d-bb0a-e053-d805fe0a78d9
|
2
|
|
New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences, file dfe4d227-6837-bb0a-e053-d805fe0a78d9
|
2
|
|
Pattern matching with swaps in practice, file dfe4d227-7d9f-bb0a-e053-d805fe0a78d9
|
2
|
|
Improved and Self-Tuned Occurrence Heuristics, file dfe4d227-80cf-bb0a-e053-d805fe0a78d9
|
2
|
|
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic, file dfe4d227-a29d-bb0a-e053-d805fe0a78d9
|
2
|
|
Congruence relations on a choice space, file dfe4d229-9b13-bb0a-e053-d805fe0a78d9
|
2
|
|
A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem, file dfe4d226-f9cc-bb0a-e053-d805fe0a78d9
|
1
|
|
Cumulative hierarchies and computability over universes of sets, file dfe4d226-fb49-bb0a-e053-d805fe0a78d9
|
1
|
|
On some combinatorial problems concerning the harmonic structure of musical chord sequences, file dfe4d226-fbda-bb0a-e053-d805fe0a78d9
|
1
|
|
New efficient bit-parallel algorithms for the (delta,alpha)-matching problem with applications in music information retrieval, file dfe4d226-fc75-bb0a-e053-d805fe0a78d9
|
1
|
|
A tableau-based decision procedure for a fragment of set theory with iterated membership, file dfe4d226-fce1-bb0a-e053-d805fe0a78d9
|
1
|
|
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs, file dfe4d227-0027-bb0a-e053-d805fe0a78d9
|
1
|
|
Solvable set/hyperset contexts: III. A tableau system for a fragment of hyperset theory, file dfe4d227-3a3d-bb0a-e053-d805fe0a78d9
|
1
|
|
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case, file dfe4d227-41ff-bb0a-e053-d805fe0a78d9
|
1
|
|
A Relational Dual Tableau Decision Procedure for Multimodal and Description Logics, file dfe4d227-51b5-bb0a-e053-d805fe0a78d9
|
1
|
|
Approximate String Matching Allowing for Inversions and Translocations, file dfe4d227-53c8-bb0a-e053-d805fe0a78d9
|
1
|
|
An Efficient Algorithm for Approximate Pattern Matching with Swaps, file dfe4d227-543c-bb0a-e053-d805fe0a78d9
|
1
|
|
Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions, file dfe4d227-5744-bb0a-e053-d805fe0a78d9
|
1
|
|
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic, file dfe4d227-5f87-bb0a-e053-d805fe0a78d9
|
1
|
|
A decision procedure for a two-sorted extension of Multi-Level Syllogistic with the Cartesian product and some map constructs, file dfe4d227-5f91-bb0a-e053-d805fe0a78d9
|
1
|
|
Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm, file dfe4d227-6188-bb0a-e053-d805fe0a78d9
|
1
|
|
Congruence Relations on a Choice Space: Revealed Indiscernibility, file dfe4d227-6a2c-bb0a-e053-d805fe0a78d9
|
1
|
|
Pattern matching with swaps for short patterns in linear time, file dfe4d227-7a76-bb0a-e053-d805fe0a78d9
|
1
|
|
Dual tableau-based decision procedures for some relational logics, file dfe4d227-7d9c-bb0a-e053-d805fe0a78d9
|
1
|
|
A New Algorithm for Efficient Pattern Matching with Swaps, file dfe4d227-7e09-bb0a-e053-d805fe0a78d9
|
1
|
|
Two-Levels Greedy: a generalization of Dijkstra's shortest path algorithm, file dfe4d227-8053-bb0a-e053-d805fe0a78d9
|
1
|
|
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach, file dfe4d227-931b-bb0a-e053-d805fe0a78d9
|
1
|
|
A graphical representation of relational formulae with complementation, file dfe4d227-95fa-bb0a-e053-d805fe0a78d9
|
1
|
|
On the elimination of quantifiers through descriptors in predicate logic, file dfe4d227-9793-bb0a-e053-d805fe0a78d9
|
1
|
|
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces, file dfe4d227-9d81-bb0a-e053-d805fe0a78d9
|
1
|
|
Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm, file dfe4d227-9ff6-bb0a-e053-d805fe0a78d9
|
1
|
|
Bit-Parallelism$^2$: Getting to the Next Level of Parallelism, file dfe4d227-a1c7-bb0a-e053-d805fe0a78d9
|
1
|
|
Dual tableau-based decision procedures for relational logics with restricted composition operator, file dfe4d227-a228-bb0a-e053-d805fe0a78d9
|
1
|
|
Herbrand-Satisfiability of a Quantified Set-theoretical Fragment, file dfe4d227-a391-bb0a-e053-d805fe0a78d9
|
1
|
|
A Sound Framework for delta-rule Variants in Free Variable Semantic Tableaux, file dfe4d227-aa26-bb0a-e053-d805fe0a78d9
|
1
|
|
A Space-Efficient Implementation of the Good-Suffix Heuristic, file dfe4d227-b56c-bb0a-e053-d805fe0a78d9
|
1
|
|
A further and effective liberalization of the delta-rule in free variable semantic tableaux, file dfe4d228-70b0-bb0a-e053-d805fe0a78d9
|
1
|
|
Speeding Up String Matching by Weak Factor Recognition, file dfe4d228-bc51-bb0a-e053-d805fe0a78d9
|
1
|
|
Games, automata, logics and formal verification (GandALF 2016), file dfe4d22a-f9ea-bb0a-e053-d805fe0a78d9
|
1
|
|
Linear and efficient string matching algorithms based on weak factor recognition, file dfe4d22b-011b-bb0a-e053-d805fe0a78d9
|
1
|
|
The order-preserving pattern matching problem in practice, file dfe4d22b-21cf-bb0a-e053-d805fe0a78d9
|
1
|
|
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership, file dfe4d22e-282b-bb0a-e053-d805fe0a78d9
|
1
|
|
Yet Another Proof Without Words of the Pythagorean Theorem, file dfe4d22e-437f-bb0a-e053-d805fe0a78d9
|
1
|
|
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem, file dfe4d22e-7860-bb0a-e053-d805fe0a78d9
|
1
|
| Totale |
404 |