Pages that link to "Item:Q2870110"

The following pages link to Logic for Programming, Artificial Intelligence, and Reasoning (Q2870110):

Displaying 50 items.

• An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics (Q2870111) (← links)
• May-Happen-in-Parallel Analysis for Priority-Based Scheduling (Q2870112) (← links)
• The Complexity of Clausal Fragments of LTL (Q2870113) (← links)
• A Semantic Basis for Proof Queries and Transformations (Q2870114) (← links)
• Expressive Path Queries on Graphs with Data (Q2870115) (← links)
• Proving Infinite Satisfiability (Q2870117) (← links)
• SAT-Based Preprocessing for MaxSAT (Q2870118) (← links)
• Dynamic and Static Symmetry Breaking in Answer Set Programming (Q2870119) (← links)
• HOL Based First-Order Modal Logic Provers (Q2870120) (← links)
• Resourceful Reachability as HORN-LA (Q2870121) (← links)
• A Seligman-Style Tableau System (Q2870122) (← links)
• Comparison of LTL to Deterministic Rabin Automata Translators (Q2870123) (← links)
• Tree Interpolation in Vampire (Q2870125) (← links)
• Polarizing Double-Negation Translations (Q2870127) (← links)
• Revisiting the Equivalence of Shininess and Politeness (Q2870128) (← links)
• Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic (Q2870129) (← links)
• Multi-objective Discounted Reward Verification in Graphs and MDPs (Q2870130) (← links)
• Description Logics, Rules and Multi-context Systems (Q2870132) (← links)
• Complexity Analysis in Presence of Control Operators and Higher-Order Functions (Q2870134) (← links)
• Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo (Q2870135) (← links)
• Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving (Q2870136) (← links)
• Verifying Temporal Properties in Real Models (Q2870137) (← links)
• A Graphical Language for Proof Strategies (Q2870138) (← links)
• A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus (Q2870139) (← links)
• Relaxing Synchronization Constraints in Behavioral Programs (Q2870140) (← links)
• Characterizing Subset Spaces as Bi-topological Structures (Q2870141) (← links)
• Proof-Pattern Recognition and Lemma Discovery in ACL2 (Q2870142) (← links)
• Semantic A-translations and Super-Consistency Entail Classical Cut Elimination (Q2870144) (← links)
• Blocked Clause Decomposition (Q2870145) (← links)
• Maximal Falsifiability (Q2870146) (← links)
• Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning (Q2870147) (← links)
• On QBF Proofs and Preprocessing (Q2870148) (← links)
• Partial Backtracking in CDCL Solvers (Q2870149) (← links)
• Lemma Mining over HOL Light (Q2870150) (← links)
• On Module-Based Abstraction and Repair of Behavioral Programs (Q2870151) (← links)
• Prediction and Explanation over DL-Lite Data Streams (Q2870152) (← links)
• Forgetting Concept and Role Symbols in $\mathcal{ALCH}$ -Ontologies (Q2870153) (← links)
• Simulating Parity Reasoning (Q2870154) (← links)
• Herbrand Theorems for Substructural Logics (Q2870155) (← links)
• On Promptness in Parity Games (Q2870156) (← links)
• Defining Privacy Is Supposed to Be Easy (Q2870157) (← links)
• Reachability Modules for the Description Logic $\mathcal{SRIQ}$ (Q2870159) (← links)
• An Event Structure Model for Probabilistic Concurrent Kleene Algebra (Q2870160) (← links)
• Three SCC-Based Emptiness Checks for Generalized Büchi Automata (Q2870161) (← links)
• PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification (Q2870162) (← links)
• Incremental Tabling for Query-Driven Propagation of Logic Program Updates (Q2870163) (← links)
• Tracking Data-Flow with Open Closure Types (Q2870164) (← links)
• Putting Newton into Practice: A Solver for Polynomial Equations over Semirings (Q2870166) (← links)
• System Description: E 1.8 (Q2870167) (← links)
• Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light (Q2870169) (← links)