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 SAT-Encodings of the At-Most-One Constraint + (1-17)
- On SAT-Encodings of the At-Most-One Constraint + (1-17)
- On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations + (1-18)
- Tableau Algorithms for Description Logics + (1-18)
- Robust mobile robot localisation from sparse and noisy proximity readings using Hough transform and probability grids + (1-18)
- The Complexity of Lattice-Based Fuzzy Description Logics + (1-19)
- Towards next generation sequential and parallel SAT solvers + (1-2)
- Usability Issues in Description Logic Knowledge Base Completion + (1-21)
- P ≠ P: Why Some Reasoning Problems Are More Tractable Than Others + (1-22)
- Automata-Theoretic Decision Procedures for Information Logics + (1-22)
- Description Logics That Count, and What They Can and Cannot Count + (1-25)
- Topological Entropy of Formal Languages + (1-26)
- Reasoning and Explanation in EL and in Expressive Description Logics + (1-27)
- Fast algorithms for implication bases and attribute exploration using proper premises + (1-29)
- Display to Labeled Proofs and Back Again for Tense Logics + (1-31)
- From Tableaux to Automata for Description Logics + (1-32)
- From Tableaux to Automata for Description Logics + (1-33)
- Lazy model checking for recursive state machines + (1-33)
- On Language Equations with One-sided Concatenation + (1-35)
- Description Logics + (1-39)
- Rational Models of Normal Logic Programs + (1-4)
- Compositional matrix-space models of language: Definitions, properties, and learning methods + (1-49)
- Fusions of Description Logics and Abstract Description Systems + (1-58)
- Cognitive Science, Computational Logic and Connectionism + (1-6)
- Automatic flow classification using machine learning + (1-6)
- Exact Learning of Lightweight Description Logic Ontologies + (1-63)
- On the Decomposition of ADFs and the Complexity of Naive-based Semantics + (1-64)
- Just: a Tool for Computing Justifications w.r.t. EL Ontologies + (1-7)
- E-Connections of Abstract Description Systems + (1-73)
- Nonstandard Inferences in Description Logics: The Story So Far + (1-75)
- Axiomatizing EL^-Expressible Terminological Knowledge from Erroneous Data + (1-8)
- Reasoning about Complex Actions + (1-9)
- Model checking meets performance evaluation + (10--15)
- Characterizing the semantics of terminological cycles with the help of finite automata + (10-14)
- Classifying Software Bug Reports Using Methods from Formal Concept Analysis + (10-27)
- Non-Global Parikh Tree Automata + (100--117)
- Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory + (101--110)
- Multi-Context Reasoning in Continuous Data-Flow Environments + (101-104)
- Towards a Logic for Causal Reasoning + (101-106)
- Fast Computation of Proper Premises + (101-113)
- Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs + (1012--1019)
- Summary Report of The First International Competition on Computational Models of Argumentation + (102)
- Application of Hierarchical Hybrid Encodings to Efficient Translation of CSPs to SAT + (1028-1035)
- Composition of Stochastic Transition Systems Based on Spans and Couplings + (102:1--102:15)
- Model Checking Performability Properties + (103--112)
- ILP Operators for Propositional Connectionist Networks + (103-108)
- Control of an Engineering-Structured Multilevel Discrete-Event System + (103-108)
- Gödel Negation Makes Unwitnessed Consistency Crisp + (103-113)
- Abduction in Logic Programming as Second-Order Quantifier Elimination + (103-119)
- Computing Stable Models for Nonmonotonic Existential Rules + (1031-1038)
