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
- Complexity of Axiom Pinpointing in the DL-Lite Family + (CEUR-WS)
- Correcting Access Restrictions to a Consequence + (CEUR-WS)
- Finite Lattices Do Not Make Reasoning in ALCI Harder + (CEUR-WS)
- GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable + (CEUR-WS)
- Unification in the Description Logic EL without the Top Concept + (CEUR-WS)
- Adding Context to Tableaux for DLs + (CEUR-WS)
- LATPub490 + (CEUR-WS)
- Gödel Negation Makes Unwitnessed Consistency Crisp + (CEUR-WS)
- Rough EL Classification + (CEUR-WS)
- Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes + (CEUR-WS)
- LATPub527 + (CEUR-WS)
- The Concept Difference for EL-Terminologies using Hypergraphs + (CEUR-WS)
- A hybrid approach for learning concept definitions from text + (CEUR-WS)
- About Subsumption in Fuzzy EL + (CEUR-WS)
- Similarity-based Relaxed Instance Queries in EL^++ + (CEUR-WS)
- LATPub439 + (CEUR-WS)
- Query Matching for Report Recommendation + (CIKM '13)
- To Encode or to Propagate? The Best Choice for Each Constraint in SAT + (CP'13)
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints + (CP'13)
- A Brief Introduction to Formal Concept Analysis + (CRC Studies in Informatics)
- Deductive Joint Support for Rational Unrestricted Rebuttal + (Computational Models of Argument)
- Spinoza's Ontology + (DFKI Research Reports)
- On topological hierarchies of temporal properties + (DIMACS Series in Discrete Mathematics and Theoretical Computer Science)
- Approximate OWL Instance Retrieval with Screech + (Dagstuhl Seminar Proceedings)
- What's in a name? — First Steps Towards a Structural Approach to Integrating Large Content-based Knowledge-Bases + (Dagstuhl-Seminar-Report 244)
- 6th Workshop on Unification + (Dagstuhl-Seminar-Report 42)
- Pcasso -- a Parallel CooperAtive Sat SOlver + (Department of Computer Science Series of Publications B)
- Generating Clique Coloring Problem Formulas + (Department of Computer Science Series of Publications B)
- Riss 4.27 + (Department of Computer Science Series of Publications B)
- SparrowToRiss + (Department of Computer Science Series of Publications B)
- CLAS – A Parallel SAT Solver that Combines CDCL, Look-Ahead and SLS Search Strategies + (Department of Computer Science Series of Publications B)
- Riss 4.27 BlackBox + (Department of Computer Science Series of Publications B)
- Too Many Rooks + (Department of Computer Science Series of Publications B)
- MinitSAT + (Department of Computer Science Series of Publications B)
- Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract) + (EPTCS)
- Nemo: First Glimpse of a New Rule Engine + (EPTCS)
- Witnessing Subsystems for Probabilistic Systems with Low Tree Width + (EPTCS)
- Counterfactual Causality for Reachability and Safety based on Distance Functions + (EPTCS)
- Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers + (EPiC Series)
- Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers + (EPiC Series)
- New CNF Features and Formula Classification + (EPiC Series)
- On conditionals + (EPiC Series in Computing)
- The Triguarded Fragment of First-Order Logic + (EPiC Series in Computing)
- The Weak Completion Semantics and Equality + (EPiC Series in Computing)
- Description Logics That Count, and What They Can and Cannot Count + (EPiC Series in Computing)
- Temporal Query Answering in DL-Lite with Negation + (EasyChair Proceedings in Computing)
- System BV is NP-complete + (Electronic Notes in Theoretical Computer Science)
- System NEL is Undecidable + (Electronic Notes in Theoretical Computer Science)
- Domain equations for probabilistic processes + (Electronic Notes in Theoretical Computer Science)
- Partial Order Reduction for Probabilistic Branching Time + (Electronic Notes in Theoretical Computer Science)
- Trace Machines for Observing Continuous-Time Markov Chains + (Electronic Notes in Theoretical Computer Science)
