LPAR 2010 - PDF Preprint Papers

LPAR 2010 Logic for Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LPAR-2010 Paper

click to vote

LPAR
2010
Springer

215views Automated Reasoning» more LPAR 2010»

On the Satisfiability of Two-Variable Logic over Data Words

13 years 10 months ago

Download homepages.inf.ed.ac.uk

Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...

Claire David, Leonid Libkin, Tony Tan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	215	On the Satisfiability of Two-Variable Logic over Data Words	claim
2	199	Dafny: An Automatic Program Verifier for Functional Correctness	claim
3	171	Speed-Up Techniques for Negation in Grounding	claim
4	165	Semiring-Induced Propositional Logic: Definition and Basic Algorithms	claim
5	163	Human and Unhuman Commonsense Reasoning	claim
6	162	The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach	claim
7	162	ABC: Algebraic Bound Computation for Loops	claim
8	161	On Strong Normalization of the Calculus of Constructions with Type-Based Termination	claim
9	159	Logic and Computation in a Lambda Calculus with Intersection and Union Types	claim
10	158	Interpolating Quantifier-Free Presburger Arithmetic	claim
11	156	A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing	claim
12	154	SAT Encoding of Unification in EL	claim
13	153	Pairwise Cardinality Networks	claim
14	148	Relentful Strategic Reasoning in Alternating-Time Temporal Logic	claim
15	148	Infinite Families of Finite String Rewriting Systems and Their Confluence	claim
16	147	Aligators for Arrays (Tool Paper)	claim
17	147	Qex: Symbolic SQL Query Explorer	claim
18	142	Synthesis of Trigger Properties	claim
19	140	Counting and Enumeration Problems with Bounded Treewidth	claim
20	139	Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference	claim
21	138	The Complexity of Partial-Observation Parity Games	claim
22	138	Graded Alternating-Time Temporal Logic	claim
23	135	PBINT, A Logic for Modelling Search Problems Involving Arithmetic	claim
24	135	Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics	claim
25	131	Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models	claim
26	130	An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory	claim
27	129	Satisfiability of Non-linear (Ir)rational Arithmetic	claim
28	127	Clause Elimination Procedures for CNF Formulas	claim
29	127	Verifying Pointer and String Analyses with Region Type Systems	claim
30	126	Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting	claim
31	124	A Syntactical Approach to Qualitative Constraint Networks Merging	claim
32	123	Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation	claim
33	123	Disunification for Ultimately Periodic Interpretations	claim
34	121	How to Universally Close the Existential Rule	claim
35	120	Automated Proof Compression by Invention of New Definitions	claim
36	120	Program Logics for Homogeneous Meta-programming	claim
37	117	Lazy Abstraction for Size-Change Termination	claim
38	113	Labelled Unit Superposition Calculi for Instantiation-Based Reasoning	claim
39	111	Partitioning SAT Instances for Distributed Solving	claim
40	103	Coping with Selfish On-Going Behaviors	claim
41	102	On the Equality of Probabilistic Terms	claim
42	102	Atomic Cut Introduction by Resolution: Proof Structuring and Compression	claim
43	102	A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae	claim
44	101	Hardness of Preorder Checking for Basic Formalisms	claim
45	98	On the Complexity of Model Expansion	claim
46	93	Polite Theories Revisited	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers