Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- Design and Evaluation of Parallel Hashing over Large-scale Data + (Proc. 21st IEEE International Conference on High Performance Computing (HiPC'14))
- Efficient Dependency Analysis for Rule-Based Ontologies + (Proc. 21st International Semantic Web Conference (ISWC 2022))
- Efficient Large Outer Joins over MapReduce + (Proc. 22nd International European Conference on Parallel Processing (Euro-Par'16))
- Efficient Rule-Based Inferencing for OWL EL + (Proc. 22nd International Joint Conference on Artificial Intelligence (IJCAI'11))
- Robust and Skew-resistant Parallel Joins in Shared-nothing Systems + (Proc. 23rd ACM International Conference on Information and Knowledge Management (CIKM'14))
- Efficient Data Redistribution to Speedup Big Data Analytics in Large Systems + (Proc. 23rd IEEE International Conference on High Performance Computing (HiPC'16))
- Computing Stable Models for Nonmonotonic Existential Rules + (Proc. 23rd International Joint Conference on Artificial Intelligence (IJCAI'13))
- Reasonable Highly Expressive Query Languages + (Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI'15))
- Characterization of the Expressivity of Existential Rule Queries + (Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI'15))
- Membership Constraints in Formal Concept Analysis + (Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI'15))
- Unchain My EL Reasoner + (Proc. 24th International Workshop on Description Logics (DL'11))
- Nominal Schemas for Integrating Rules and Description Logics + (Proc. 24th International Workshop on Description Logics (DL'11))
- Fixed Parameter Tractable Reasoning in DLs via Decomposition + (Proc. 24th International Workshop on Description Logics (DL'11))
- A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory + (Proc. 25th ACM International Conference on Hypertext and Social Media (HT'14))
- Massively Parallel Reasoning under the Well-Founded Semantics using X10 + (Proc. 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'14))
- Nonmonotonic Existential Rules for Non-Tree-Shaped Ontological Modelling + (Proc. 26th International Workshop on Description Logics (DL'13))
- How to Best Nest Regular Path Queries + (Proc. 27th International Workshop on Description Logics (DL'14))
- Complexities of Nominal Schemas + (Proc. 27th International Workshop on Description Logics (DL'14))
- High Throughput Indexing for Large-scale Semantic Web Data + (Proc. 30th ACM/SIGAPP Symposium On Applied Computing (SAC'15))
- Flag & Check: Data Access with Monadically Defined Queries + (Proc. 32nd Symposium on Principles of Database Systems (PODS'13))
- Expressiveness of guarded existential rule languages + (Proc. 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'14))
- P ≠ P: Why Some Reasoning Problems Are More Tractable Than Others + (Proc. 8th International Conference on Web Reasoning and Rule Systems (RR'14))
- Efficient Feature Parameterisation for Visual SLAM Using Inverse Depth Bundles + (Proc. BMVC'08)
- A Framework For Evaluating Visual SLAM + (Proc. BMVC'09)
- Planar Features for Visual SLAM + (Proc. German Conference on Artificial Intelligence (KI 2008))
- Solving Hidokus using SAT Solvers + (Proc. INFOCOM-5)
- Efficient SAT-Encoding of Linear CSP Constraints + (Proc. International Symposium on Artificial Intelligence and Mathematics (ISAIM-2014), Special session on Boolean and pseudo-Boolean Functions, January 6â8, Fort Lauderdale, FL, USA, 2014, to appear)
- On SAT-Encodings of the At-Most-One Constraint + (Proc. The Twelfth International Workshop on Constraint Modelling and Reformulation, Uppsala, Sweden, September 16-20)
- Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen + (Proc. of 11th International Workshop on Descriptional Complexity of Formal Systems (DCFS))
- On Algorithms and Extensions of Coordination Control of Discrete-Event Systems + (Proc. of 11th International Workshop on Discrete Event Systems (WODES))
- A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking + (Proc. of 11th Italian Conference on Theoretical Computer Science (ICTCS))
- On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops + (Proc. of 12th International Conference on Automata and Formal Languages (AFL))
- State Complexity of Projected Languages + (Proc. of 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS))
- Complexity in Union-Free Regular Languages + (Proc. of 14th International Conference on Developments in Language Theory)
- Formal Parameter Synthesis for Energy-Utility-Optimal Fault Tolerance + (Proc. of 15th European Workshop on Computer Performance Engineering (EPEW))
- Ontology-Mediated Probabilistic Model Checking + (Proc. of 15th International Conference on integrated Formal Methods)
- On the State Complexity of the Reverse of R- and J-Trivial Regular Languages + (Proc. of 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS))
- Performance Evaluation of Thermal-Constrained Scheduling Strategies in Multi-core Systems + (Proc. of 16th European Workshop on Computer Performance Engineering (EPEW))
- Compositional Feature-oriented Systems + (Proc. of 17th International Conference on Software Engineering and Formal Methods)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs + (Proc. of 17th International Conference on Implementation and Application of Automata (CIAA))
- Generic Emptiness Check for Fun and Profit + (Proc. of 17th International Symposium on Automated Technology for Verification and Analysis)
- SWITSS: Computing Small Witnessing Subsystems + (Proc. of 20th Conference on Formal Methods in Computer-Aided Design (FMCAD 2020))
- Bisimulations, logics, and trace distributions for stochastic systems with rewards + (Proc. of 21st International Conference on Hybrid Systems: Computation and Control (HSCC))
- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights + (Proc. of 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19))
- From Features to Roles + (Proc. of 24th International Systems and Software Product Line Conference (SPLC))
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints + (Proc. of 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS))
- Breaking the Limits of Redundancy Systems Analysis + (Proc. of 29th European Safety and Reliability Conference (ESREL))
- Reduction Methods on Error-Propagation Graphs for Quantitative Systems Reliability Analysis + (Proc. of 30th European Safety and Reliability Conference (ESREL) and 15th Probabilistic Safety Assessment and Management Conference (PSAM))
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes + (Proc. of 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS))
- Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification + (Proc. of 33rd International Workshop on Description Logics (DL))
- Long-run Satisfaction of Path Properties + (Proc. of 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS))