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

• CDCL Solver Additions: Local Look-ahead, All-Unit-UIP Learning and On-the-fly Probing  + (Norbert)
• npSolver - a SAT based Solver for Optimization Problems  + (Norbert)
• The SAT Solver Framework priss  + (Norbert)
• Coprocessor 2.0 - A flexible CNF Simplifier  + (Norbert)
• A Compact Encoding of Pseudo-Boolean Constraints into SAT  + (Norbert)
• Refining Unsatisfiable Cores in Incremental SAT Solving  + (Norbert)
• An A-Maze-ing SAT Solving Visualization  + (Norbert)
• Hidden Units, Equivalences and Implications (Poster Presentation)  + (Norbert)
• SATPin: Axiom Pinpointing for Lightweight Description Logics through Incremental SAT  + (Norbert)
• Neuro-Symbolic Word Tagging  + (Nuno C.)
• The Complexity of the Graded mu-Calculus  + (O.)
• E-connections of Description Logics  + (O.)
• E-Connections of Abstract Description Systems  + (O.)
• Tabu Search Revisited  + (Olaf)
• A new context-based -subsumption algorithm  + (Olga)
• Say "No" to Grounding: An Inference Algorithm for First-Order MDPs  + (Olga)
• Control of Distributed Systems: Tutorial and Overview  + (Olivier)
• Hierarchical control with partial observations: Sufficient conditions  + (Olivier)
• Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency  + (Ozan)
• System BV is NP-complete  + (Ozan)
• Reducing Nondeterminism in the Calculus of Structures  + (Ozan)
• Implementing System BV of the Calculus of Structures in Maude  + (Ozan)
• Towards Planning as Concurrency  + (Ozan)
• System BV without the Equalities for Unit  + (Ozan)
• Implementing Deep Inference in TOM  + (Ozan)
• A formal assessment result for fluent calculus using the action description language A_k  + (Ozan)
• Nondeterminism and Language Design in Deep Inference  + (Ozan)

• Different Approaches to the Semantics of Workflow  + (P.)
• Expressive Non-Monotonic Description Logics Based on Circumscription  + (P.)
• Expressive Non-Monotonic Description Logics Based on Circumscription  + (P.)
• Structures and Deduction - the Quest for the Essence of Proofs (satellite workshop of ICALP 2005)  + (P.)
• The Complexity of Enriched µ-Calculi  + (P.)

• A purely logical account of sequentiality in proof search – extended abstract  + (Paola)
• On Structuring Proof Search for First Order Linear Logic  + (Paola)
• A Tutorial on Proof Theoretic Foundations of Logic Programming  + (Paola)
• On Structuring Proof Search for First Order Linear Logic  + (Paola)
• A Purely Logical Account of Sequentiality in Proof Search  + (Paola)
• Specification of a common framework for characterizing alignment  + (Paolo)
• Rare-Event Verification for Stochastic Hybrid Systems  + (Paolo)
• Reasoning about Probabilistic Lossy Channel Systems  + (Parosh Aziz)
• Simulating perfect channels with probabilistic lossy channels  + (Parosh Aziz)
• A categorical view on algebraic lattices in formal concept analysis  + (Pascal)
• Semantic Web - Grundlagen  + (Pascal)
• Foundations of Semantic Web Technologies  + (Pascal)
• Integrated view and comparison of alignment semantics  + (Pascal)
• Report on realizing practical approximate and distributed reasoning for ontologies  + (Pascal)
• Querying formal contexts with answer set programs  + (Pascal)
• Approximate OWL Instance Retrieval with Screech  + (Pascal)
• What Is Ontology Merging? – A Category-Theoretical Perspective Using Pushouts  + (Pascal)
• DLP isn't so bad after all  + (Pascal)
• Proceedings of the Workshop on Foundations of Artificial Intelligence, FAInt-07, at KI-2007, Osnabrück, Germany, September 2007  + (Pascal)
• 语义Web技术基础  + (Pascal)
• Default reasoning over domains and concept hierarchies  + (Pascal)
• Towards a Systematic Account of Different Logic Programming Semantics  + (Pascal)
• A "Converse" of the Banach Contraction Mapping Theorem  + (Pascal)