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
- What Is a Reasonable Argumentation Semantics? + (309-324)
- Combination Problems for Commutative/Monoidal Theories: How Algebra Can Help in Equational Reasoning + (309-337)
- Simple Default Reasoning in Theories of Action + (31--40)
- Bisimulations, logics, and trace distributions for stochastic systems with rewards + (31--40)
- Situation Recognition for Service Management Systems Using OWL 2 Reasoners + (31-36)
- A Logic-Based Approach to Dynamic Programming + (31-36)
- Asynchronous Multi-Context Systems + (31-38)
- Hacía un marco ontológico y epistemológico para una metodología de la verificación de los programas computacionales en ciencia de la computación + (31-62)
- Conjunctive Queries for a Tractable Fragment of OWL 1.1 + (310--323)
- Reasoning in Semantic Wikis + (310--329)
- Standpoint Linear Temporal Logic + (311-321)
- Semantic MediaWiki + (311-326)
- Designing a Counter: Another case study of Dynamics and Activation Landscapes in Recurrent Networks + (313-324)
- Computing First-Order Logic Programs by Fibring Artificial Neural Networks + (314-319)
- Discovering Implicational Knowledge in Wikidata + (315--323)
- On Upper and Lower Bounds on the Length of Alternating Towers + (315-326)
- Membership Constraints in Formal Concept Analysis + (3186-3192)
- Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles + (319-324)
- A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata + (319-328)
- Expressive Number Restrictions in Description Logics + (319-350)
- Characterization of the Expressivity of Existential Rule Queries + (3193-3199)
- Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization + (32--37)
- Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization + (32-37)
- Acquiring Generalized Domain-Range Restrictions + (32-45)
- Reifying RDF: What Works Well With Wikidata? + (32-47)
- Reasoning about Probabilistic Lossy Channel Systems + (320--333)
- A Method of Estimating Oriented Surface Elements from Stereo Images + (320-329)
- Using FCA for Encoding of Closure Operators into Neural Networks + (321 -- 332)
- MoDDo - a tailored documentation system for model-driven software development + (321-324)
- Greener Bits: Formal Analysis of Demand Response + (323--339)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints + (324--345)
- Data Complexity in Expressive Description Logics With Path Expressions + (3241--3249)
- Ontology Based Query Answering with Existential Rules + (3245-3246)
- Open Problems in Abstract Argumentation + (325--339)
- Terminological Cycles in a Description Logic with Existential Restrictions + (325-330)
- On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops + (325-336)
- Tableaux for Projection Computation and Knowledge Compilation + (325-340)
- Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL + (3258-3267)
- The Weak Completion Semantics and Equality + (326-342)
- Succinctness and tractability of closure operator representations + (327 - 345)
- Verification of Knowledge-Based Programs over Description Logic Actions + (3278-3284)
- dARe -- Using Argumentation to Explain Conclusions from a Controlled Natural Language Knowledge Base + (328--338)
- Credo Methodology: Modeling and Analyzing a Peer-to-Peer System in Credo + (33--48)
- Hybrid Knowledge Organization within an Object Framework + (33-41)
- Matching with respect to general concept inclusions in the Description Logic EL + (33-44)
- A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages + (33-54)
- Temporalizing Ontology-Based Data Access + (330-344)
- Unification of Concept Terms in Description Logics + (331-335)
- On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components + (331-340)
- Be lazy and don’t care: Faster CTL model checking for recursive state machines + (332–350)
