Search by property

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

List of results

• Formula Simplifications as DRAT Derivations  + (111-122)
• Equational Logic and Theories of Action  + (111-123)
• Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case  + (111-124)
• OWL 2 Profiles: An Introduction to Lightweight Ontology Languages  + (112-183)
• Compact Rewritings for Existential Rules  + (1125-1131)
• Quantitative Characterization of Reconfigurable Transistor Logic Gates  + (112598 - 112614)
• Modeling and Verification of Components and Connectors  + (114--147)
• Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems  + (114-133)
• Stage semantics and the SCC-recursive schema for argumentation semantics  + (1149-1202)
• On the Limits of Decision: the Adjacent Fragment of First-Order Logic  + (114:1--114:20)
• Explicit and Implicit Indeterminism: Reasoning about uncertain and contradictory specifications of dynamic systems  + (115-119)
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage  + (115-127)
• NEXAS: A Visual Tool for Navigating and Exploring Argumentation Solution Spaces  + (116-127)
• Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics  + (117-130)
• On the Decidability Status of Fuzzy ALC with General Concept Inclusions  + (117-146)
• Responsibility Attribution in Parameterized Markovian Models  + (11734-11743)
• Interactive ontology revision  + (118-130)
• Logic on MARS: Ontologies for generalised property graphs  + (1188-1194)
• Weak Bisimulation for Fully Probabilistic Processes  + (119--130)
• A Concept Language for an engeneering application with part-whole relations  + (119-123)
• Weight Monitoring with Linear Temporal Logic: Complexity and Decidability  + (11:1--11:10)
• Extending Two-Variable Logic on Trees  + (11:1--11:20)
• Investigating Subclasses of Abstract Dialectical Frameworks  + (12-14)
• Description Logics  + (12-19)
• Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers  + (12-25)

• From Display to Labelled Proofs for Tense Logics  + (120-139)

• (Non-)Succinctness of uniform interpolants of general terminologies in the description logic ℰℒ  + (120-140)
• Datalog-Expressibility for Monadic and Guarded Second-Order Logic  + (120:1-120:17)
• Iterative Variable Reordering: Taming Huge System Families  + (121--133)
• The Weak Completion Semantics and Counterexamples  + (121--154)
• Tableaux for Temporal Description Logic with Constant Domain  + (121-136)
• Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics  + (121-164)
• Modeling Role-Based Systems with Exogenous Coordination  + (122--139)
• Retractable Complex Event Processing and Stream Reasoning  + (122-137)
• A Sound and Complete Backward Chaining Algorithm for Existential Rules  + (122-138)
• Finite Lattices Do Not Make Reasoning in ALCOI Harder  + (122-141)
• Defaults in Action: Non-monotonic Reasoning About States in Action Calculi  + (123--128)
• Probabilistic weak simulation is decidable in polynomial time  + (123--130)
• Rational Models of Normal Logic Programs  + (123-134)
• A More Compact Translation of Pseudo-Boolean Constraints into CNF such that Generalized Arc Consistency is Maintained  + (123-134)
• On the Exploration of the Query Rewriting Space with Existential Rules  + (123-137)
• Expressivity of Datalog Variants - Completing the Picture  + (1230-1236)
• Estrategias de combinación de recursos lexicográficos en la adquisición de lenguas extranjeras (en contextos específicos)  + (124 - 145)
• Adding Homomorphisms to Commutative/Monoidal Theories, or: How Algebra Can Help in Equational Unification  + (124-135)
• Hardness of Enumerating Pseudo-Intents in the Lectic Order  + (124-137)
• Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics  + (124-139)
• Exclusivity-based allocation of knowledge  + (1249-1250)
• Model Checking for a Probabilistic Branching Time Logic with Fairness  + (125--155)
• The PIE system for Proving, Interpolating and Eliminating  + (125-138)
• On conditional decomposability  + (1260–1268)
• A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem  + (127-139)