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
- Challenge Problems for the Integration of Logic and Connectionist Systems + (161-170)
- Practical Reasoning for Expressive Description Logics + (161-180)
- Compositional Feature-oriented Systems + (162--180)
- Massively Parallel Reasoning under the Well-Founded Semantics using X10 + (162-169)
- Reasoning about Actions Meets Strategic Logics + (162-175)
- The Relative Expressiveness of Abstract Argumentation and Logic Programming + (1625--1631)
- A computational logic approach to human spatial reasoning + (1627-1634)
- Complexity in Union-Free Regular Languages + (1639-1653)
- On Properties and State Complexity of Deterministic State-Partition Automata + (164-178)
- Actions and Specificity + (164-180)
- Multi-Agent Knowledge Allocation + (165-178)
- On boolean combinations forming piecewise testable languages + (165-179)
- Approximate OWL-Reasoning with Screech + (165-180)
- Temporal Query Answering in the Description Logic DL-Lite + (165-180)
- Global One-Counter Tree Automata + (166--179)
- Multilingual Terminology Acquisition for Ontology-based Information Extraction + (166-175)
- Modal Logics with Composition on Finite Forests: Expressivity and Complexity + (167--180)
- Recurrent Neural Networks to Approximate the Semantics of Acceptable Logic Programs + (167-178)
- A Generic Approach for Correcting Access Restrictions to a Consequence + (167-182)
- Dimensions of neural-symbolic integration — a structured survey + (167-194)
- Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology + (168-178)
- A Framework for Reasoning about Dynamic Axioms in Description Logics + (1681--1687)
- Probabilistic Model Checking for Energy Analysis in Software Product Lines + (169--180)
- RBAC Authorization Decision with DL Reasoning + (169-176)
- Is Your Database System a Semantic Web Reasoner? + (169-176)
- A rule-based ontological framework for the classification of molecules + (17)
- How to reason with OWL in a logic programming system + (17--26)
- Too Much Information: Can AI Cope With Modern Knowledge Graphs? + (17--31)
- Generalizing multi-context systems for reactive stream reasoning applications + (17-24)
- Acquisition, Representation, and Extension of Multilingual Labels of Financial Ontologies + (17-26)
- A Computational Logic Approach to Syllogisms in Human Reasoning + (17-31)
- Decidable Description Logics of Context with Rigid Roles + (17-32)
- Descriptional Complexity of Generalized Forbidding Grammars + (170-177)
- A cartesian closed category of approximable concept structures + (170-185)
- Denotational Semantics in the CPO and Metric Approach + (171--220)
- Reasoning in ALC with Fuzzy Concrete Domains + (171-182)
- Probabilistic Models for Reo Connector Circuits + (1718--1748)
- All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs + (1719--1725)
- A compact fuzzy extension of the Naive Bayesian classification algorithm + (172-177)
- Are Fuzzy Description Logics with General Concept Inclusion Axioms Decidable? + (1735-1742)
- On the expressiveness of MTL and TPTL over omega-data words + (174--187)
- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors + (175-189)
- A Modified Supervaluationist Framework for Decision-Making + (175-191)
- Using Automata Theory for Characterizing the Semantics of Terminological Cycles + (175-219)
- Knowledge-Based Support for Scholarly Editing and Text Processing + (176-179)
- Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis + (176-191)
- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL + (177-188)
- SAT-Based Analysis and Quantification of Information Flow in Programs + (177-192)
- Complexity of Universality and Related Problems for Partially Ordered NFAs + (177-192)
- Representing Abstract Dialectical Frameworks with Binary Decision Diagrams + (177-198)
