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
- Completing Incomplete Bayesian Networks + (231-243)
- A Non-commutative Extension of MELL + (231-246)
- Breaking the Limits of Redundancy Systems Analysis + (2317--2325)
- Undecidability of Fuzzy Description Logics + (232-242)
- The DIAMOND System for Computing with Abstract Dialectical Frameworks + (233--240)
- The DIAMOND System for Computing with Abstract Dialectical Frameworks + (233-240)
- Linear Deductive Planning + (233-262)
- Efficient Inferencing for OWL EL + (234-246)
- Employing Description Logics in Ambient Intelligence for Modeling and Reasoning about Complex Situations + (235-259)
- Combining Interval-based Temporal Reasoning with General TBoxes + (235-274)
- Metric completion versus ideal completion + (236--248)
- Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications + (236--251)
- SWITSS: Computing Small Witnessing Subsystems + (236-244)
- Towards Building Ontologies from Crowdsourced Data + (236-246)
- A Resource–Oriented Deductive Approach towards Hierarchical Planning + (237-246)
- Abstract Dialectical Frameworks + (237-285)
- A Logical Geo-Ontology Design Pattern for Quantifying over Types + (239-248)
- Practical Reasoning for Very Expressive Description Logics + (239-264)
- Wissen als Code: Die Welt der Wissensgraphen und Ontologien + (24-28)
- Decomposing Finite Closure Operators by Attribute Exploration + (24-37)
- Components in Probabilistic Systems: Suitable by Construction + (240--261)
- Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas + (241-252)
- SPARQL Beyond Subgraph Matching + (241-256)
- On Integrating Description Logics and Rules under Minimal Hypotheses + (242-245)
- Connectionist Model Generation: A First-Order Approach + (2420-2432)
- The Subsumption Problem in the Fuzzy Description Logic ALC_FH + (243-250)
- cf2 Semantics Revisited + (243-254)
- On the Number of Bipolar Boolean Functions + (2431--2449)
- Acyclicity Conditions and their Application to Query Answering in Description Logics + (243–253)
- On rejected arguments and implicit conflicts: The hidden power of argumentation semantics + (244--284)
- Fast Dual Simulation Processing of Graph Database Queries + (244-255)
- On Algorithms and Extensions of Coordination Control of Discrete-Event Systems + (245-250)
- Logic Programs and Connectionist Networks + (245-272)
- An Introduction to Ontology-Based Query Answering with Existential Rules + (245-278)
- A Theory of Hypothesis Finding in Clausal Logic + (246-257)
- A uniform framework for modeling and verifying components and connectors + (247--267)
- Supervisory control synthesis of discrete-event systems using a coordination scheme + (247-254)
- Undecidability Results for Database-Inspired Reasoning Problems in Very Expressive Description Logics + (247-257)
- Satisfiability for MTL and TPTL over non-monotonic data words + (248--259)
- UniMoK: A System for Combining Equational Unification Algorithms + (248-251)
- Answering Instance Queries Relaxed by Concept Similarity + (248-257)
- Towards State Update Axioms: Reifying Successor State Axioms + (248-263)
- In Memory of Steffen Hölldobler: From Logic to Formal and Cognitive Reasoning + (249--254)
- Complexity of Infimal Observable Superlanguages + (249-254)
- Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks + (249-264)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications + (249-265)
- Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract) + (25--46)
- Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes + (25-29)
- A generalized resolution theorem + (25-30)
- Small is again Beautiful in Description Logics + (25-33)
