In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only twoâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown toâ€¦Â (More)

Is this relevant?

2013

2013

- Amaldev Manuel, Thomas Zeume
- CSL
- 2013

This paper continues the study of the two-variable fragment of first-order logic (FO2) over twodimensional structures, moreâ€¦Â (More)

Is this relevant?

2013

2013

- Saguy Benaim, Michael Benedikt, +4 authors James Worrell
- ICALP
- 2013

Verification of properties expressed in the two-variable fragment of first-order logic FO2 has been investigated in a number ofâ€¦Â (More)

Is this relevant?

2012

2012

- Michael Benedikt, Rastislav Lenhardt, James Worrell
- 2012 Ninth International Conference onâ€¦
- 2012

Two-variable logic is a fragment of first-order logic that allows for decidable verification problems. In previous work, weâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
- ACM Trans. Comput. Log.
- 2011

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. This model hasâ€¦Â (More)

Is this relevant?

2011

2011

- Matthias Niewerth, Thomas Schwentick
- ICDT
- 2011

The paper introduces key constraints for data words and shows that it is decidable whether, for a given two-variable sentenceâ€¦Â (More)

Is this relevant?

2010

2010

- Thomas Schwentick, Thomas Zeume
- Logical Methods in Computer Science
- 2010

The finite satisfiability problem for two-variable logic over structures with unary relations and two order relations isâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
- 21st Annual IEEE Symposium on Logic in Computerâ€¦
- 2006

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models haveâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes ofâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
- SIAM J. Comput.
- 2000

Let C 2 p denote the class of rst order sentences with two variables and with additional quantiiers \there exists exactly (atâ€¦Â (More)

Is this relevant?