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
- On the State Complexity of the Reverse of R- and J-Trivial Regular Languages + (136-147)
- Semantic Wikipedia (software demo) + (137--138)
- Recognizing $ømega$-regular Languages with Probabilistic Automata + (137--146)
- A Model and Method to Terminologize Existing Domain Ontologies + (137-136)
- Coordination Control of Distributed Discrete-Event Systems + (137-144)
- Complexity and Succinctness of Public Announcement Logic + (137-144)
- An Abstract Machine for Reasoning about Situations, Actions, and Causality + (137-151)
- Blackhole Pushdown Automata + (137-156)
- Relationship with other Formalisms + (137-177)
- Scale-Out Processing of Large RDF Datasets + (138-150)
- Finding Finite Herbrand Models + (138-152)
- A Declarative Framework for Matching Iterative and Aggregative Patterns against Event Streams + (138-153)
- On Skolem-Hardness and Saturation Points in Markov Decision Processes + (138:1--138:17)
- Query Matching for Report Recommendation + (1391-1400)
- Robust and Skew-resistant Parallel Joins in Shared-nothing Systems + (1399-1408)
- Tuple-Generating Dependencies Capture Complex Values + (13:1--13:20)
- Hypothesis Finding with Proof Theoretical Appropriateness Criteria + (140-162)
- Capturing Homomorphism-Closed Decidable Queries with Existential Rules + (141--150)
- On topological hierarchies of temporal properties + (141--170)
- Access Policy Design Supported by FCA Methods + (141-154)
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics + (1413-1452)
- Complexity Results for Probabilistic Datalog+/- + (1414–1422)
- Russian Learner Corpus: Towards Error-Cause Annotation for L2 Russian + (14240-14258)
- Formal Concept Analysis Methods for Dynamic Conceptual Graphs + (143-156)
- Metric Completion versus Ideal Completion + (145--171)
- Approximate Symbolic Model Checking of Continuous-Time Markov Chains + (146--161)
- An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog + (146--163)
- Exploring Finite Models in the Description Logic ELgfp + (146-161)
- Coordination Control of Distributed Discrete-Event Systems + (147-167)
- Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation + (147-168)
- Answer-set programming encodings for argumentation frameworks + (147-177)
- A Logical Analysis of Instrumentality Judgments: Means-End Relations in the Context of Experience and Expectations + (1475–1516)
- Pushing the Boundaries of Tractable Ontology Reasoning. + (148--163)
- Comparative branching-time semantics for Markov chains + (149--214)
- Putting ABox Updates into Action + (149-164)
- Runtime Verification Using a Temporal Description Logic + (149-164)
- The Syllogistic Reasoning Task: Reasoning Principles and Heuristic Strategies in Modeling Human Clusters + (149-165)
- Embedding Defaults into Terminological Representation Systems + (149-180)
- Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas + (149–177)
- The effect of tossing coins in omega-automata + (15--29)
- Determinization and Limit-Determinization of Emerson-Lei Automata + (15--31)
- Matching in Description Logics: Preliminary Results + (15-34)
- On the Succinctness of Closure Operator Representations + (15-36)
- Efficient Separability of Regular Languages by Subsequences and Suffixes + (150-161)
- Introductions to Description Logics - A Guided Tour + (150-161)
- What Is Approximate Reasoning? + (150-164)
- Answering conjunctive queries in the SHIQ description logic + (150-197)
- A Computational Logic Approach to the Suppression Task + (1500-1505)
- Some Notes on Pseudo-closed Sets + (151 - 165)
- Intensional Question Answering using ILP: What does an answer mean? + (151-162)
