Pages that link to "Item:Q2946565"
From MaRDI portal
The following pages link to ACM Transactions on Computational Logic (Q2946565):
Displaying 50 items.
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- Monadic second order logic on graphs with local cardinality constraints (Q2946629) (← links)
- The tractability of model checking for LTL (Q2946630) (← links)
- Annotated Probabilistic Temporal Logic (Q2946661) (← links)
- Permissive-nominal logic (Q2946669) (← links)
- Deductive inference for the interiors and exteriors of horn theories (Q2946672) (← links)
- Graded computation tree logic (Q2946674) (← links)
- Hierarchies in Dependence Logic (Q2946680) (← links)
- Fuzzy Equilibrium Logic (Q2946682) (← links)
- First-Order Logic on Higher-Order Nested Pushdown Trees (Q2946692) (← links)
- Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems (Q2946695) (← links)
- Query-Driven Procedures for Hybrid MKNF Knowledge Bases (Q2946701) (← links)
- Constraint Propagation for First-Order Logic and Inductive Definitions (Q2946703) (← links)
- Logical foundations for more expressive declarative temporal logic programming languages (Q2946717) (← links)
- Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators (Q2946724) (← links)
- Structural Focalization (Q2946730) (← links)
- A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases (Q2946749) (← links)
- The Local Universes Model (Q2957763) (← links)
- Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) (← links)
- Representation results for defeasible logic (Q3184510) (← links)
- Syntax-Preserving Belief Change Operators for Logic Programs (Q4579961) (← links)
- Quantitative Aspects of Linear and Affine Closed Lambda Terms (Q4581460) (← links)
- Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols (Q4608717) (← links)
- An Epistemic Strategy Logic (Q4617971) (← links)
- Symmetric Circuits for Rank Logic (Q5056365) (← links)
- Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation (Q5056366) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- Toward a Uniform Theory of Effectful State Machines (Q5121274) (← links)
- Model Checking MITL Formulae on Timed Automata (Q5121277) (← links)
- Finite Open-world Query Answering with Number Restrictions (Q5121278) (← links)
- A logic programming approach to knowledge-state planning (Q5277695) (← links)
- Induction from answer sets in nonmonotonic logic programs (Q5277720) (← links)
- An effective decision procedure for linear arithmetic over the integers and reals (Q5277733) (← links)
- Propositional computability logic I (Q5277750) (← links)
- Propositional computability logic II (Q5277751) (← links)
- A formally verified proof of the prime number theorem (Q5277791) (← links)
- Outlier detection by logic programming (Q5277796) (← links)
- First-order complete and computationally complete query languages for spatio-temporal databases (Q5277802) (← links)
- Reasoning about actions with sensing under qualitative and probabilistic uncertainty (Q5277823) (← links)
- From Small Space to Small Width in Resolution (Q5277893) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL <sup>+</sup> (Q5277905) (← links)
- Lax Theory Morphisms (Q5277906) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Horn Fragments of the Halpern-Shoham Interval Temporal Logic (Q5369240) (← links)
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers (Q5410333) (← links)
- Mechanizing UNITY in Isabelle (Q5738896) (← links)
- Search and strategies in OPL (Q5738908) (← links)
- Strongly equivalent logic programs (Q5738917) (← links)
