wanyu/IteraTeR_v2 huggingface dataset:
Original:  Two algorithms for computing the uniform interpolant of a quantifier-free formula in EUF endowed with a list of symbols to be eliminated are proposed.
Revised:  Two algorithms for computing quantifier-free uniform interpolants of the theory of equality over uninterpreted symbols (EUF) endowed with a list of symbols to be eliminated are proposed.
Edit intent: clarity
Original:  The first algorithm is non-deterministic and generates a uniform interpolant expressed as a disjunction of conjunction of literals, whereas the second algorithm gives a compact representation of a uniform interpolant as a conjunction of Horn clauses.
Revised:  The first algorithm is non-deterministic and generates a uniform interpolant expressed as a disjunction of conjunctions of literals, whereas the second algorithm gives a compact representation of a uniform interpolant as a conjunction of Horn clauses.
Edit intent: fluency
Original:  Both algorithms exploit efficient dedicated DAG representation of terms.
Revised:  Both algorithms exploit efficient dedicated DAG representations of terms.
Edit intent: fluency
Original:  Correctness and completeness proofs are supplied, using arguments combining rewrite techniques with model-theoretic tools .
Revised:  Correctness and completeness proofs are supplied, using arguments combining rewrite techniques with model theory .
Edit intent: clarity
Original: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially very large AoI.
Revised: Minimization of the expected value of age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially very large AoI.
Edit intent: clarity
Original: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially very large AoI.
Revised: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) is a risk-neutral approach, and it thus cannot capture rare yet critical events with potentially very large AoI.
Edit intent: coherence
Original: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially very large AoI.
Revised: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare , yet critical, events with potentially very large AoI.
Edit intent: fluency
Original: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially very large AoI.
Revised: For time-sensitive Internet of Things (IoT) applications, a risk-neutral approach for age of information (AoI) optimization which focuses only on minimizing the expected value of the AoI based cost function, cannot capture rare yet critical events with potentially large AoI.
Edit intent: clarity
Original:  Thus , in this paper, in order to quantify such rare events, an effective coherent risk measure, called the conditional value-at-risk (CVaR) , is studied for the purpose of minimizing the AoI of real-time IoT status updates.
Revised:  Thus , in this paper, the notion of conditional value-at-risk (CVaR) , is studied for the purpose of minimizing the AoI of real-time IoT status updates.
Edit intent: clarity
Original:  Thus , in this paper, in order to quantify such rare events, an effective coherent risk measure, called the conditional value-at-risk (CVaR) , is studied for the purpose of minimizing the AoI of real-time IoT status updates.
Revised:  Thus , in this paper, in order to quantify such rare events, an effective coherent risk measure, called the conditional value-at-risk (CVaR) is proposed as an effective coherent risk measure that is suitable for minimization of AoI for real-time IoT status updates.
Edit intent: clarity
Original:  Particularly, a real-time IoT monitoring systemis considered in which an IoT device monitors a physical process and sends the status updates to a remote receiver with an updating cost.
Revised:  In the considered monitoring system, an IoT device monitors a physical process and sends the status updates to a remote receiver with an updating cost.
Edit intent: clarity
Original:  The optimal status updating process is designed to jointly minimize the AoI at the receiver, the CVaR of the AoI at the receiver, and the energy cost.
Revised:  The optimal status update process is designed to jointly minimize the AoI at the receiver, the CVaR of the AoI at the receiver, and the energy cost.
Edit intent: fluency
Original:  By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which , a dynamic programming based solution is proposed to derive the optimal stationary policy  .
Revised:  By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which we derive the optimal stationary policy .
Edit intent: coherence
Original:  By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which , a dynamic programming based solution is proposed to derive the optimal stationary policy  .
Revised:  By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which , a dynamic programming based solution is proposed to derive the optimal stationary policy using dynamic programming .
Edit intent: coherence
Original:  The proposed solution is  computationally tractable and minimizes the AoI in real-time IoT monitoring systems in a risk-aware manner.
Revised:  The proposed solution is shown to be computationally tractable and minimizes the AoI in real-time IoT monitoring systems in a risk-aware manner.
Edit intent: clarity
Original:  The proposed solution is  computationally tractable and minimizes the AoI in real-time IoT monitoring systems in a risk-aware manner.
Revised:  The proposed solution is computationally tractable and able to minimize the AoI in real-time IoT monitoring systems in a risk-aware manner.
Edit intent: clarity
Original:  " Signature in counterparts" is a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Revised:  " Signature in counterparts" , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Edit intent: coherence
Original:  The paper develops a logical understanding of this process, developing a number of axioms that can be used to justify the validity of a contract from the assumption that separate copies have been signed.
Edit intent: coherence
Original:  The axioms used are supported by a formal semantics, and a number of further properties of this semantics are investigated.
Revised:  The axioms used are supported by a formal semantics, and a number of further properties of the logic are investigated.
Edit intent: clarity
Original:  In particular, it is shown that the semantics implies that when a contract is valid , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the validity of the contract.
Revised:  In particular, it is shown that the logic implies that when a contract is valid , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the validity of the contract.
Edit intent: clarity
Original:  In particular, it is shown that the semantics implies that when a contract is valid , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the validity of the contract.
Revised:  In particular, it is shown that the semantics implies that when a contract has been signed , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the validity of the contract.
Edit intent: clarity
Original:  In particular, it is shown that the semantics implies that when a contract is valid , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the validity of the contract.
Revised:  In particular, it is shown that the semantics implies that when a contract is valid , the parties do not just agree, but are in mutual agreement (a common-knowledge-like notion) about the terms of the contract.
Edit intent: clarity
Original:  A number of axioms and rules of inference are developed that can be used to justify a " meeting of the minds " precondition for contract formation from the fact that certain content has been signed.
Revised:  A number of axioms and rules of inference are developed that can be used to justify a `` meeting of the minds " precondition for contract formation from the fact that certain content has been signed.
Edit intent: fluency
Original:  A number of axioms and rules of inference are developed that can be used to justify a " meeting of the minds " precondition for contract formation from the fact that certain content has been signed.
Revised:  A number of axioms and rules of inference are developed that can be used to justify a " meeting of the minds '' precondition for contract formation from the fact that certain content has been signed.
Edit intent: fluency
Original:  In addition to an " offer and acceptance " process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Revised:  In addition to an `` offer and acceptance " process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Edit intent: fluency
Original:  In addition to an " offer and acceptance " process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Revised:  In addition to an " offer and acceptance '' process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Edit intent: fluency
Original:  In addition to an " offer and acceptance " process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Revised:  In addition to an " offer and acceptance " process, the paper considers `` signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Edit intent: fluency
Original:  In addition to an " offer and acceptance " process, the paper considers " signature in counterparts " , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Revised:  In addition to an " offer and acceptance " process, the paper considers " signature in counterparts '' , a legal process that permits a contract between two or more parties to be brought into force by having the parties independently (possibly, remotely) sign different copies of the contract, rather than placing their signatures on a common copy at a physical meeting.
Edit intent: fluency
Original: In this article, we highlight what appears to be major issue of Variational Autoencoders, evinced from an extensive experimentation with different network architectures and datasets: the variance of generated data is sensibly lower than that of training data.
Revised: In this article, we highlight what appears to be major issue of Variational Autoencoders, evinced from an extensive experimentation with different network architectures and datasets: the variance of generated data is significantly lower than that of training data.
Edit intent: clarity
Original:  However, most existing approaches are time-consuming due to the requirement of small effective time steps .
Revised:  However, most existing approaches are time-consuming due to the requirement of small effective step sizes .
Edit intent: clarity
Original:  Moreover, we design a hybrid approach that applies an inexact Newton method to further accelerate the local convergence  .
Revised:  A practical Newton method is also designed to further accelerate the local convergence .
Edit intent: clarity
Original:  One key feature of our algorithm is that the energy dissipation and mass conservation properties hold during the iteration process.
Revised:  One key feature of our algorithms is that the energy dissipation and mass conservation properties hold during the iteration process.
Edit intent: fluency
Original:   Extensive numerical experiments, including two three dimensional periodic crystals in Landau-Brazovskii (LB) model and a two dimensional quasicrystal in Lifshitz-Petrich (LP) model, demonstrate that our approaches have adaptive time steps which lead to a significant acceleration over many existing methods when computing complex structures.
Revised:  Extensive numerical experiments, including two three dimensional periodic crystals in Landau-Brazovskii (LB) model and a two dimensional quasicrystal in Lifshitz-Petrich (LP) model, demonstrate that our approaches have adaptive step sizes which lead to a significant acceleration over many existing methods when computing complex structures.
Edit intent: clarity
Original: This paper considers the multi-item inventory lot-sizing problem with supplier selection.
Revised: We consider the multi-item inventory lot-sizing problem with supplier selection.
Edit intent: clarity
Original:  The problem consists in determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, taking into account the fact that multiple suppliers are available to purchase from.
Revised:  The problem consists of determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, taking into account the fact that multiple suppliers are available to purchase from.
Edit intent: fluency
Original:  The problem consists in determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, taking into account the fact that multiple suppliers are available to purchase from.
Revised:  The problem consists in determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, considering that multiple suppliers are available to purchase from.
Edit intent: clarity
Original:  We propose a facility location extended formulation for the problem which can be preprocessed based on the cost structure and describe new valid inequalities in the original space of variables , which we denote (l,S_j)-inequalities .
Revised:  We propose a facility location extended formulation for the problem which can be preprocessed based on the cost structure and describe new valid inequalities in the original space of variables .
Edit intent: coherence
Original:  Furthermore, we study the projection of the extended formulation into the original space and show the connection between the inequalities generated by this projection and the newly proposed (l,S_j)-inequalities .
Revised:  Furthermore, we study the projection of the extended formulation into the original space and show the connection between the inequalities generated by this projection and the newly proposed inequalities .
Edit intent: coherence
Original:   Computational results show that the preprocessed facility location extended formulation outperforms all other formulations for small and medium instances, as it can solve nearly all of them to optimality within the time limit  .
Revised:  Computational results show that the preprocessing approach can significantly reduce the size of the formulation to be solved, allowing both an increase in the number of instances solved to optimality within the time limit .
Edit intent: clarity
Original:  Numerical implementation of the reconstruction algorithm is presented.
Revised:  A numerical implementation of the reconstruction algorithm is presented.
Edit intent: fluency
Original:  To address all the above issues, we present a simple-yet-effective gradual channel pruning while training methodology using a novel data driven metric referred as Feature relevance score.
Revised:  To address all the above issues, we present a simple-yet-effective gradual channel pruning while training methodology using a novel data-driven metric referred to as feature relevance score.
Edit intent: fluency
Original:  The proposed technique gets rid of the additional retraining cycles by pruning  least important channels in a structured fashion at fixed intervals during the actual training phase.
Revised:  The proposed technique gets rid of the additional retraining cycles by pruning the least important channels in a structured fashion at fixed intervals during the actual training phase.
Edit intent: fluency
Original:  A key technical challenge of the work is to prove exact convergence of the proposed decentralized learning algorithm in the presence of quantization noise with unbounded variance over directed graphs.
Revised:  A key technical challenge of the work is to prove exact convergence of the proposed decentralized learning algorithm in the presence of quantization noise with unbounded variance over directed graphs.
Edit intent: fluency
Original:  A key technical challenge of the work is to prove exact convergence of the proposed decentralized learning algorithm in the presence of quantization noise with unbounded variance over directed graphs.
Edit intent: coherence
Original:  We provide numerical evaluations that corroborate our main theoretical results and illustrate significant speed-up compared to the exact-communication methods.
Revised:  Numerical evaluations corroborate our main theoretical results and illustrate significant speed-up compared to the exact-communication methods.
Edit intent: clarity
Original: To deal with increasing amounts of uncertainty and incompleteness in relational data, we propose unifying techniques from probabilistic databases and relational embedding models .
Revised: We propose unifying techniques from probabilistic databases and relational embedding models .
Edit intent: clarity
Original:  While this formalization can be used with any relational embedding model, the lack of a well defined joint probability distribution causes simple  problems to become provably hard.
Revised:  While this formalization can be used with any relational embedding model, the lack of a well-defined joint probability distribution causes simple problems to become provably hard.
Edit intent: fluency
Original:  With this in mind, we introduce \TO, a relational embedding model designed in terms of probabilistic databases to exploit typical embedding assumptions within the probabilistic framework.
Revised:  With this in mind, we introduce \TO, a relational embedding model designed to be a tractable probabilistic database, by exploiting typical embedding assumptions within the probabilistic framework.
Edit intent: clarity
Original:  Using  principled, efficient inference algorithms that can be derived from its definition, we empirically demonstrate that \TOs is an effective and general model for these  tasks.
Revised:  Using a principled, efficient inference algorithms that can be derived from its definition, we empirically demonstrate that \TOs is an effective and general model for these tasks.
Edit intent: fluency
Original:  Using  principled, efficient inference algorithms that can be derived from its definition, we empirically demonstrate that \TOs is an effective and general model for these  tasks.
Revised:  Using principled, efficient inference algorithm that can be derived from its definition, we empirically demonstrate that \TOs is an effective and general model for these tasks.
Edit intent: fluency
Original: Citations are ubiquitous in evaluating research, but how exactly they relate to what they are thought to measure (quality and intellectual impact) is unclear .
Revised: Researchers cite works for a variety of reasons, including some having nothing to do with acknowledging influence. The distribution of different citation types in the literature, and which papers attract which types, is poorly understood .
Edit intent: clarity
Original:  The analysis is performed on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset.
Revised:  The experiments are conducted on the Alzheimers Disease Neuroimaging Initiative (ADNI) dataset.
Edit intent: clarity
Original:  The analysis is performed on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset.
Revised:  The analysis is performed on the Alzheimer's Disease Neuroimaging Initiative dataset. Results:
Edit intent: clarity
Original:  However, existing SNNs error backpropagation (BP) track methods lack proper handling of spiking discontinuities and suffer from low performance compared to BP methods for traditional artificial neural networks.
Revised:  However, existing SNN error backpropagation (BP) track methods lack proper handling of spiking discontinuities and suffer from low performance compared to BP methods for traditional artificial neural networks.
Edit intent: fluency
Original:  However, existing SNNs error backpropagation (BP) track methods lack proper handling of spiking discontinuities and suffer from low performance compared to BP methods for traditional artificial neural networks.
Revised:  However, existing SNNs error backpropagation (BP) methods lack proper handling of spiking discontinuities and suffer from low performance compared to BP methods for traditional artificial neural networks.
Edit intent: clarity