32 citations · 43 across the 4 of their papers we have counts for
6 papers
Finite Satisfiability of Two-Variable Logic with Arbitrarily Many Successors
Artur Jeż, Jakub Michaliszyn, Piotr Witkowski
We study finite satisfiability of two-variable first-order logic over structures equipped with an arbitrary finite number of independent successor relations of linear orders. The n…
EntroPrefill: Renyi-Guided Context Pruning with Conditional Stability Guarantees for Retrieval-Augmented Generation
Inbasekaran S
Mid-prefill pruning can reduce the sequence processed by deeper transformer layers, but attention concentration alone does not certify that discarded context is dispensable. We for…
Sub-Sharvin conductance and enhanced shot noise in doped graphene
Adam Rycerz, Piotr Witkowski
Ideal Sharvin contact in a multimode regime shows the conductance (with the conductance quantum, the Fermi momentum, and the…
Completing the Picture: Complexity of Graded Modal Logics with Converse
Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski
A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames have already been establish…
Two-variable Logic with Counting and a Linear Order
Witold Charatonik, Piotr Witkowski
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structur…
Bounded Model Checking of Pointer Programs Revisited
Witold Charatonik, Piotr Witkowski
Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following…