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
- Conjunctive Queries for EL with Role Composition + (250)
- A Non-commutative Extension of MELL + (2514)
- A Local System for Linear Logic + (2514)
- Minimised Residue Hypotheses in Relevant Logic + (2533)
- Metric semantics for true concurrent real time + (254)
- Complexity of Universality and Related Problems for Partially Ordered NFAs + (255)
- Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying + (255)
- Reactive multi-context systems: Heterogeneous reasoning in dynamic environments + (256)
- LTL to Deterministic Emerson-Lei Automata + (256)
- Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination + (256)
- Completing Description Logic Knowledge Bases using Formal Concept Analysis + (258)
- Real-Time Complex Event Recognition and Reasoning-a Logic Programming Approach + (26)
- Stage semantics and the SCC-recursive schema for argumentation semantics + (26)
- Description Logics as Ontology Languages for the Semantic Web + (2605)
- On the Limits of Decision: the Adjacent Fragment of First-Order Logic + (261)
- The Logical Difference for ELHr-Terminologies using Hypergraphs + (263)
- Multi-context systems for reactive reasoning in dynamic environments + (263)
- Defining Relations: a general incremental approach with spatial temporal case studies + (263)
- Clause Simplifications in Search-Space Decomposition-Based SAT Solvers + (264)
- Decomposing Abstract Dialectical Frameworks + (266)
- The DIAMOND System for Computing with Abstract Dialectical Frameworks + (266)
- Implementing Instantiation of Knowledge Bases in Argumentation Frameworks + (266)
- A Benchmark Framework for a Computational Argumentation Competition + (266)
- The DIAMOND System for Computing with Abstract Dialectical Frameworks + (266)
- Credo Methodology: Modeling and Analyzing a Peer-to-Peer System in Credo + (266)
- Description Logics that Count, and What They Can and Cannot Count (Extended Abstract) + (2663)
- Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation (SAFA'20) + (2672)
- Weighted automata with storage + (269)
- Linear context-free tree languages and inverse homomorphisms + (269)
- A Note on Unification Type Zero + (27)
- Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication + (27)
- FLUCAP: A Heuristic Search Planner for First-Order MDPs + (27)
- Fast Compression of Large Semantic Web Data using X10 + (27)
- Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers + (27)
- New CNF Features and Formula Classification + (27)
- On the Number of Bipolar Boolean Functions + (27)
- Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers + (27)
- A Resource–Oriented Deductive Approach towards Hierarchical Planning + (270)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination + (272)
- Entropic Risk for Turn-Based Stochastic Games + (272)
- The Complexity of Finite Model Reasoning in Description Logics + (2741)
- A Translation of Looping Alternating Automata to Description Logics + (2741)
- Proceedings of the 19th International Conference on Automated Deduction CADE-19 + (2741)
- Description Logics for Ontologies + (2746)
- Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics + (2746)
- Comparative Branching-Time Semantics + (2761)
- Proceedings of the Workshop on Foundations of Artificial Intelligence, FAInt-07, at KI-2007, Osnabrück, Germany, September 2007 + (277)
- Design and results of the second international competition on computational models of argumentation + (279)
- Description Logics with Aggregates and Concrete Domains + (28)
- Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond + (28)
- Atomic Cut Elimination for Classical Logic + (2803)
- Linear weighted tree automata with storage and inverse linear tree homomorphisms + (281)
- The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semantics + (2821)
- Towards a Systematic Account of Different Logic Programming Semantics + (2821)
- A formal assessment result for fluent calculus using the action description language A_k + (2821)
- Continuity of Semantic Operators in Logic Programming and their Approximation by Artificial Neural Networks + (2821)
- Fixed-Domain Reasoning for Description Logics + (285)
- A Uniform Account of Realizability in Abstract Argumentation + (285)
