Suche mittels Attribut

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

• The Complexity of Quantitative Information Flow in Recursive Programs  + (10.4230/LIPIcs.FSTTCS.2012.534)
• Modulo Counting on Words and Trees.  + (10.4230/LIPIcs.FSTTCS.2017.12)
• Reachability in Dynamical Systems with Rounding  + (10.4230/LIPIcs.FSTTCS.2020.36)
• On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics  + (10.4230/LIPIcs.FSTTCS.2021.36)
• On Skolem-Hardness and Saturation Points in Markov Decision Processes  + (10.4230/LIPIcs.ICALP.2020.138)
• From Verification to Causality-Based Explications  + (10.4230/LIPIcs.ICALP.2021.1)
• Datalog-Expressibility for Monadic and Guarded Second-Order Logic  + (10.4230/LIPIcs.ICALP.2021.120)
• Preserving Constraints with the Stable Chase  + (10.4230/LIPIcs.ICDT.2018.12)
• Tuple-Generating Dependencies Capture Complex Values  + (10.4230/LIPIcs.ICDT.2022.13)
• Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying  + (10.4230/LIPIcs.ICDT.2023.18)
• Towards a General Argumentation System based on Answer-Set Programming  + (10.4230/LIPIcs.ICLP.2010.265)
• Circumscription and Projection as Primitives of Logic Programming  + (10.4230/LIPIcs.ICLP.2010.281)
• On the Complexity of Universality for Partially Ordered NFAs  + (10.4230/LIPIcs.MFCS.2016.61)
• Piecewise Testable Languages and Nondeterministic Automata  + (10.4230/LIPIcs.MFCS.2016.67)
• Towards Model Theory of Ordered Logics: Expressivity and Interpolation  + (10.4230/LIPIcs.MFCS.2022.15)
• Dismatching and local disunification in EL  + (10.4230/LIPIcs.RTA.2015.40)
• A note on C2 interpreted over finite data-words  + (10.4230/LIPIcs.TIME.2020.17)
• Generalizing multi-context systems for reactive stream reasoning applications  + (10.4230/OASIcs.ICCSW.2013.19)
• Foundations of probability-raising causality in Markov decision processes  + (10.46298/LMCS-20(1:4)2024)
• Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?  + (10.46298/lmcs-18(3:5)2022)
• The DIAMOND system for argumentation: Preliminary report  + (10.48550/arXiv.1312.6140)
• Existential Notation3 Logic  + (10.48550/arXiv.2308.07332)
• Efficient Rule-Based Inferencing for OWL EL  + (10.5591/978-1-57735-516-8/IJCAI11-444)
• Smoke Test Planning using Answer Set Programming  + (10.9781/ijimai.2021.02.003)
• Solving a PSPACE-complete problem by gene assembly  + (\url{http://dx.doi.org/10.1093/logcom/exr052})

• Winning Snake: Design Choices in Multi-Shot ASP  + (doi.org/10.1017/S1471068424000267)

• Decentrally Coordinated Execution of Adaptations in Distributed Self-Adaptive Software Systems  + (doi.org/10.1109/SASO.2017.20)
• On the Decidability Status of Fuzzy ALC with General Concept Inclusions  + (http://dx.doi.org/10.1007/s10992-014-9329-3)
• The Limits of Decidability in Fuzzy Description Logics with General Concept Inclusions  + (http://dx.doi.org/10.1016/j.artint.2014.09.001)
• Consistency Reasoning in Lattice-Based Fuzzy Description Logics  + (http://dx.doi.org/10.1016/j.ijar.2013.07.006)
• Completion-based Generalization Inferences for the Description Logic ELOR with Subjective Probabilities  + (http://dx.doi.org/10.1016/j.ijar.2014.03.001)
• Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited  + (http://dx.doi.org/10.1016/j.jal.2014.09.001)
• Similarity-based Relaxed Instance Queries  + (http://dx.doi.org/10.1016/j.jal.2015.01.002)
• The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees  + (http://dx.doi.org/10.1016/j.tcs.2014.02.036)
• Temporalizing Rewritable Query Languages over Knowledge Bases  + (http://dx.doi.org/10.1016/j.websem.2014.11.007)
• Temporal Query Entailment in the Description Logic SHQ  + (http://dx.doi.org/10.1016/j.websem.2014.11.008)
• Fuzzy Answer Sets Approximations  + (http://dx.doi.org/10.1017/S1471068413000471)
• Cost-Utility Analysis in Probabilistic Models  + (http://dx.doi.org/10.1109/TASE.2016.10)
• The Logical Difference for ELHr-Terminologies using Hypergraphs  + (http://dx.doi.org/10.3233/978-1-61499-419-0-555)
• Cut-Free Calculi and Relational Semantics for Temporal STIT Logics  + (https://doi.org/10.1007/978-3-030-19570-0_52)
• Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics  + (https://doi.org/10.1007/978-3-030-33792-6_13)
• A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms  + (https://doi.org/10.1007/978-3-030-44638-3_14)
• A Framework for Intuitionistic Grammar Logics  + (https://doi.org/10.1007/978-3-030-89391-0_29)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (https://doi.org/10.1007/978-3-031-15707-3_17)
• Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy  + (https://doi.org/10.1007/978-3-031-15707-3_8)
• On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic  + (https://doi.org/10.1007/978-3-031-87054-5_8)
• Pushing the Boundaries of Tractable Ontology Reasoning.  + (https://doi.org/10.1007/978-3-319-11915-1_10)
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage  + (https://doi.org/10.1007/978-3-319-23021-4_11)
• A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem  + (https://doi.org/10.1007/978-3-319-30000-9_10)
• Linear Context-Free Tree Languages and Inverse Homomorphisms  + (https://doi.org/10.1007/978-3-319-30000-9_37)
• Rule-Based OWL Modeling with ROWLTab Protégé Plugin  + (https://doi.org/10.1007/978-3-319-58068-5_26)