English
Related papers

Related papers: A Hierarchical Situation Calculus

200 papers

This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of…

Optimization and Control · Mathematics 2016-06-21 Ignacio Blanco , Juan M. Morales

Passive documents and active programs now widely comingle. Document languages include Turing-complete programming elements, and programming languages include sophisticated document notations. However, there are no formal foundations that…

Programming Languages · Computer Science 2023-11-15 Will Crichton , Shriram Krishnamurthi

Several convergence results in Hilbert scales under different source conditions are proved and orders of convergence and optimal orders of convergence are derived. Also, relations between those source conditions are proved. The concept of a…

Functional Analysis · Mathematics 2015-06-03 Gisela L. Mazzieri , Ruben D. Spies

We propose a hierarchical splitting approach to differential equations that provides a design principle for constructing splitting methods for $N$-split systems by iteratively applying splitting methods for two-split systems. We analyze the…

Numerical Analysis · Mathematics 2026-01-21 Kevin Schäfers , Michael Günther

Circumscription and logic programs under the stable model semantics are two well-known nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus…

Artificial Intelligence · Computer Science 2014-01-21 Joohyung Lee , Ravi Palla

From daily discussions to marketing ads to political statements, information manipulation is rife. It is increasingly more important that we have the right set of tools to defend ourselves from manipulative rhetoric, or fallacies. Suitable…

Artificial Intelligence · Computer Science 2023-10-26 Ryuta Arisaka , Ryoma Nakai , Yusuke Kawamoto , Takayuki Ito

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

Uncertainties in the real world mean that is impossible for system designers to anticipate and explicitly design for all scenarios that a robot might encounter. Thus, robots designed like this are fragile and fail outside of…

Robotics · Computer Science 2023-10-02 Ricardo Cannizzaro , Jonathan Routley , Lars Kunze

We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…

Computational Geometry · Computer Science 2025-12-24 Josef Grus , Zdeněk Hanzálek , Christian Artigues , Cyrille Briand , Emmanuel Hebrard

We set up a left ring of fractions over a certain ring of boundary problems for linear ordinary differential equations. The fraction ring acts naturally on a new module of generalized functions. The latter includes an isomorphic copy of the…

Rings and Algebras · Mathematics 2012-09-07 Markus Rosenkranz , Anja Korporal

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Mathematical Physics · Physics 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

Hierarchical task decomposition is a method used in many agent systems to organize agent knowledge. This work shows how the combination of a hierarchy and persistent assertions of knowledge can lead to difficulty in maintaining logical…

Artificial Intelligence · Computer Science 2011-06-27 J. E. Laird , R. E. Wray

This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…

Functional Analysis · Mathematics 2022-11-22 Peter G. Casazza , Laura De Carli , Tin T. Tran

We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…

Logic in Computer Science · Computer Science 2017-09-20 Antonis Achilleos

We describe a process calculus featuring high level constructs for component-oriented programming in a distributed setting. We propose an extension of the higher-order pi-calculus intended to capture several important mechanisms related to…

Programming Languages · Computer Science 2009-09-04 Daniel Hirschkoff , Aurélien Pardon , Tom Hirschowitz , Samuel Hym , Damien Pous

These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…

Number Theory · Mathematics 2018-09-14 Gabor Wiese

Statistical static timing analysis deals with the increasing variations in manufacturing processes to reduce the pessimism in the worst case timing analysis. Because of the correlation between delays of circuit components, timing model…

Hardware Architecture · Computer Science 2017-05-16 Bing Li , Ning Chen , Manuel Schmidt , Walter Schneider , Ulf Schlichtmann

The paper presents an explicit state-based modeling approach aimed at modeling Systems of Systems behavior. The approach allows to specify and verify incrementally safety and liveness rules without using model checking techniques. The…

Software Engineering · Computer Science 2013-11-15 Luca Pazzi

We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without…

Logic in Computer Science · Computer Science 2013-04-01 Alberto Carraro , Thomas Ehrhard , Antonino Salibra

The paper describes multistage design of composite (modular) systems (i.e., design of a system trajectory). This design process consists of the following: (i) definition of a set of time/logical points; (ii) modular design of the system for…

Artificial Intelligence · Computer Science 2013-06-20 Mark Sh. Levin