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
- Using Queries as Schema-Templates for Graph Databases + (2)
- Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms + (2)
- Advanced Solving Technology for Dynamic and Reactive Applications + (2)
- The Basics of Display Calculi + (2)
- A Modified Supervaluationist Framework for Decision-Making + (2)
- Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory + (2)
- Partially Ordered Automata and Piecewise Testability + (2)
- On Composing Finite Forests with Modal Logics + (2)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views + (2)
- Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics + (2)
- Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. + (2)
- Chase Termination Beyond Polynomial Time + (2)
- The Weak Completion Semantics and Counterexamples + (2)
- Denotational Semantics in the CPO and Metric Approach + (2)
- On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints + (2)
- Comparative branching-time semantics for Markov chains + (2)
- Experiments with deterministic $ømega$-automata for formulas of linear temporal logic + (2)
- A note on the attractor-property of infinite-state Markov chains + (2)
- Modeling component connectors in Reo by constraint automata + (2)
- Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata + (2)
- Decidability of Querying First-Order Theories via Countermodels of Finite Width + (2)
- Restricted Chase Termination: You Want More than Fairness + (2 (PODS))
- Using Automata Theory for Characterizing the Semantics of Terminological Cycles + (2--4)
- A categorical view on algebraic lattices in formal concept analysis + (2-3)
- Blackhole Pushdown Automata + (2-3)
- Estrategias de combinación de recursos lexicográficos en la adquisición de lenguas extranjeras (en contextos específicos) + (23)
- Rekurrente Neuronale Netze zur Approximation der Semantik akzeptabler logischer Programme + (27)
- Shortipedia: Aggregating and Curating Semantic Web Data + (3)
- Computing Intensional Answers to Questions - An Inductive Logic Programming Approach + (3)
- A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata + (3)
- Unification in Commutative Theories, Hilbert's Basis Theorem and Gröbner Bases + (3)
- A Description Logic with Transitive and Inverse Roles and Role Hierarchies + (3)
- A Description Logic with Concrete Domains and Role-forming Predicates + (3)
- Expressive Number Restrictions in Description Logics + (3)
- Matching in Description Logics + (3)
- Practical Reasoning for Very Expressive Description Logics + (3)
- Unification of Concepts Terms in Description Logics + (3)
- Computing the Least Common Subsumer w.r.t. a Background Terminology + (3)
- Employing Description Logics in Ambient Intelligence for Modeling and Reasoning about Complex Situations + (3)
- Unification in the Description Logic EL + (3)
- LTL over Description Logic Axioms + (3)
- FABEL + (3)
- Logic Programs and Connectionist Networks + (3)
- The Fuzzy Description Logic ALC_FH with Hedge Algebras as Concept Modifiers + (3)
- Unique Supported-Model Classes of Logic Programs + (3)
- Logic Programs, Iterated Function Systems, and Recurrent Radial Basis Function Networks + (3)
- Study of the Polymorphism of the Patagonian Calceolaria Polyrhiza (Calceolariaceae) using Decision Tree and Sequential Covering Rule Induction + (3)
- Cognitive Argumentation for Human Syllogistic Reasoning + (3)
- Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements + (3)
- SATPin: Axiom Pinpointing for Lightweight Description Logics through Incremental SAT + (3)
