Suche mittels Attribut

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

• Succinctness and tractability of closure operator representations  + (0304-3975)
• On boolean combinations forming piecewise testable languages  + (0304-3975)
• One-Variable Logic Meets Presburger Arithmetic  + (0304-3975)
• Self-Regulating Finite Automata  + (0324-721X)
• Cooperating Distributed Grammar Systems with Random Context Grammars as Components  + (0324-721X)
• On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops  + (0324-721X)
• Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars  + (0324-721X)
• Real-Time Complex Event Recognition and Reasoning-a Logic Programming Approach  + (0883-9514)
• Complexity of Universality and Related Problems for Partially Ordered NFAs  + (0890-5401)
• Linear weighted tree automata with storage and inverse linear tree homomorphisms  + (0890-5401)
• Description Logic Rules  + (0922-6389)
• Coordination control of discrete-event systems revisited  + (0924-6703)
• Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication  + (0924-6703)
• Effektiver Algorithmus zur Lösung von inversen Aufgabenstellungen - Anwendung in der Geotechnik  + (0932-8351)
• Control of Distributed Systems: Tutorial and Overview  + (0947-3580)
• On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics  + (0955-792X)
• The Basics of Display Calculi  + (10198288)
• Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is Your Friend!  + (1076 - 9757)
• On context-free rewriting with a simple restriction and its computational completeness  + (1290-385X)
• Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof  + (1365-8050)
• Towards next generation sequential and parallel SAT solvers  + (1383-7133)
• Topological Entropy of Formal Languages  + (1432-2137)
• Die zwei Kulturen  + (1439-3107)
• Semantic Wikipedia  + (1439-3107)
• Display to Labeled Proofs and Back Again for Tense Logics  + (1529-3785)
• On Composing Finite Forests with Modal Logics  + (1529-3785)
• Description Logics  + (1541-1672)
• Semantic Wikipedia  + (1570-8268)
• Interactive ontology revision  + (1570-8268)
• The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies  + (1573-0670)
• Multi-Context Reasoning in Continuous Data-Flow Environments  + (1610-1987)
• Advanced Solving Technology for Dynamic and Reactive Applications  + (1610-1987)

• Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas  + (1613-0073)
• Conjunctive Queries for EL with Role Composition  + (1613-0073)
• DLP isn't so bad after all  + (1613-0073)
• Encoding Closure Operators into Neural Networks  + (1613-0073)
• General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase (Extended Abstract)  + (1613-0073)
• Logics for Reasoning about Preferences, Uncertainty, and Vagueness  + (1613-0073)
• On the Abstract Expressive Power of Description Logics with Concrete Domains  + (1613-0073)
• Proceedings of the Workshop on Foundations of Artificial Intelligence, FAInt-07, at KI-2007, Osnabrück, Germany, September 2007  + (1613-0073)
• Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017)  + (1613-0073)
• Refining Ontologies by Pattern-Based Completion  + (1613-0073)
• Relational Exploration - Reconciling Plato and Aristotle  + (1613-0073)
• Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints  + (1613-0073)
• Supplementary Proceedings of ICCS'09  + (1613-0073)
• The Precise Complexity of Reasoning in ALC with ω-Admissible Concrete Domains  + (1613-0073)
• Third Conceptual Structures Tool Interoperability Workshop (CS-TIW 2008)  + (1613-0073)

• Semantic Web - Grundlagen  + (1614-5216)
• Foundations of probability-raising causality in Markov decision processes  + (1860-5974)
• Towards Propositional KLM-Style Defeasible Standpoint Logics  + (1865-0929)
• Non-monotonic Extensions to Formal Concept Analysis via Object Preferences  + (1865-0929)
• Temporal Logics with Local Constraints  + (1868-8969)
• On the Complexity of Universality for Partially Ordered NFAs  + (1868-8969)
• Piecewise Testable Languages and Nondeterministic Automata  + (1868-8969)
• Preserving Constraints with the Stable Chase  + (1868-8969)
• Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents  + (1868-8969)
• Tuple-Generating Dependencies Capture Complex Values  + (1868-8969)
• Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying  + (1868-8969)
• A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem  + (1868-8969)
• Smoke Test Planning using Answer Set Programming  + (1989-1660)
• Temporal Query Answering in DL-Lite with Negation  + (2040-557X)
• A Modified Supervaluationist Framework for Decision-Making  + (2069-0533)
• Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)  + (2075-2180)
• Nemo: First Glimpse of a New Rule Engine  + (2075-2180)
• General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase (Extended Technical Report)  + (2159-5399)