English
Related papers

Related papers: Context-Dependent Effects and Concurrency in Guard…

200 papers

Whereas an extension with non-interference of Hoare logic for sequential programs Owicki--Gries logic ensures the correctness of concurrent programs on strict consistency, it is unsound to weak memory models adopted by modern computer…

Logic in Computer Science · Computer Science 2026-02-17 Tatsuya Abe

When assessing relations between argumentative units (e.g., support or attack), computational systems often exploit disclosing indicators or markers that are not part of elementary argumentative units (EAUs) themselves, but are gained from…

Computation and Language · Computer Science 2019-06-11 Juri Opitz , Anette Frank

Results of measurements give legitimacy to a physical theory. What if acquiring these results in the first place necessitates what the same theory considers to be an interaction? In this note, we assume that theories account for…

Quantum Physics · Physics 2019-05-01 Arne Hansen , Stefan Wolf

Driven by advances in Large Language Models (LLMs), integrating them into recommendation tasks has gained interest due to their strong semantic understanding and prompt flexibility. Prior work encoded user-item interactions or metadata into…

Information Retrieval · Computer Science 2025-06-10 Keyu Zhao , Fengli Xu , Yong Li

Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some…

Logic in Computer Science · Computer Science 2015-07-01 Mohamed Faouzi Atig , Ahmed Bouajjani , Shaz Qadeer

We present an algebraic semantics for governed execution in which governance is axiomatized, compositional, and coterminous with expressibility. The framework, mechanized in 32 Rocq modules (~12,000 lines, 454 theorems, 0 admitted), is…

Artificial Intelligence · Computer Science 2026-05-27 Alan L. McCann

Retrieval-augmented generation (RAG) improves performance on knowledge-intensive tasks but can be derailed by wrong, irrelevant, or conflicting retrieved text, causing models to rely on inaccurate evidence and cascade errors. We propose…

Computation and Language · Computer Science 2026-02-26 Chenyu Lin , Yilin Wen , Du Su , Hexiang Tan , Fei Sun , Muhan Chen , Chenfu Bao , Zhonghou Lyu

Context-Oriented Programming languages provide us with primitive constructs to adapt program behaviour depending on the evolution of their operational environment, namely the context. In previous work we proposed ML_CoDa, a context-oriented…

Programming Languages · Computer Science 2016-06-21 Pierpaolo Degano , Gian-Luigi Ferrari , Letterio Galletta

Reactive systems are composed of a well defined set of input events that the system reacts with by executing an associated handler to each event. In concurrent environments, event handlers can interact with the execution of other programs…

Software Engineering · Computer Science 2018-10-19 Yongwang Zhao , David Sanan , Fuyuan Zhang , Yang Liu

We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is…

Logic in Computer Science · Computer Science 2023-06-22 Julien Grange

We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. New information is incorporated into the current knowledge base subject to a causal rejection principle…

Artificial Intelligence · Computer Science 2007-05-23 T. Eiter , M. Fink , G. Sabbatini , H. Tompits

This paper presents equational-based logics for proving first order properties of programming languages involving effects. We propose two dual inference system patterns that can be instanciated with monads or comonads in order to be used…

Logic in Computer Science · Computer Science 2013-10-15 Jean-Guillaume Dumas , Dominique Duval , Jean-Claude Reynaud

Higher-order constrained Horn clauses (HoCHC) are a semantically-invariant system of higher-order logic modulo theories. With semi-decidable unsolvability over a semi-decidable background theory, HoCHC is suitable for safety verification.…

Formal Languages and Automata Theory · Computer Science 2021-09-13 Jerome Jochems

Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-driven environments. An important problem to be addressed is how to…

Artificial Intelligence · Computer Science 2010-08-05 Adrian Paschke , Alexander Kozlenkov , Harold Boley

Constraint Handling Rules is an effective concurrent declarative programming language and a versatile computational logic formalism. CHR programs consist of guarded reactive rules that transform multisets of constraints. One of the main…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-09 Thom Fruehwirth

Neural sequence to sequence models are well established for applications which can be cast as mapping a single input sequence into a single output sequence. In this work, we focus on cases where generation is conditioned on both a short…

Computation and Language · Computer Science 2019-11-25 Xinyi Wang , Jason Weston , Michael Auli , Yacine Jernite

Large language models are able to learn new tasks in context, where they are provided with instructions and a few annotated examples. However, the effectiveness of in-context learning is dependent on the provided context, and the…

Computation and Language · Computer Science 2023-12-25 Afra Amini , Massimiliano Ciaramita

Recent improvements in conditional generative modeling have made it possible to generate high-quality images from language descriptions alone. We investigate whether these methods can directly address the problem of sequential…

Machine Learning · Computer Science 2023-07-11 Anurag Ajay , Yilun Du , Abhi Gupta , Joshua Tenenbaum , Tommi Jaakkola , Pulkit Agrawal

Large language models (LLMs) generate outputs by utilizing extensive context, which often includes redundant information from prompts, retrieved passages, and interaction history. In critical applications, it is vital to identify which…

Computation and Language · Computer Science 2026-02-03 Poushali Sengupta , Shashi Raj Pandey , Sabita Maharjan , Frank Eliassen

We study the evolution of behavioral rules in environments with multiple contexts. Agents copy rules used by better-performing peers in the same context and apply them across contexts. Multiple contexts turn discrete-time imitation dynamics…

Theoretical Economics · Economics 2026-05-08 Enrique Urbano Arellano , Xinyang Wang