An energy-based a posteriori error bound is proposed for the physics-informed neural network solutions of elasticity problems. admissible displacement-stress solution pair obtained from mixed form networks, and formulated as constitutive relation defined by pair. Such an estimator provides upper global discretization. The bounding property, well asymptotic behavior solutions, are studied in dem...

We present a new approach to reasoning about the outcome of an argumentation framework, where an agent’s reasoning with a framework and semantics is represented by an inference relation defined over a logical labeling language. We first study a monotonic type of inference which is, in a sense, more general than an acceptance function, but equally expressive. In order to overcome the limitations...

We present a formal model for two-agent discovery dialogues. The model allows agents to collectively discover a realization for a shared goal, using argumentation dialogues to exchange information. This information is in the form of rules, assumptions, and contraries of assumptions as in Assumption-based Argumentation (ABA). With dialogues, agents jointly build arguments and construct shared AB...

The Lie product and the order relation are viewed as defining structures for Hamiltonian dynamical systems. Their admissible combinations are singled out by the requirement that the group of the Lie automorphisms be contained in the group of the order automorphisms (Lie algebras with invariant cones). Taking advantage of the reciprocal independence of the relevant structures, the inclusion rela...

In undirected networks of identical linear oscillators coupled through dissipative and restorative connectors (e.g., pendulums undergoing small vibrations connected via dampers springs), the relation between asymptotic synchronization coupling structure is studied. Conditions on interconnection under which can be achieved for some selection strengths are established. How to strengthen those con...

We investigate refinement in the context of choreographies. introduce refinable global choreographies allowing for underspecification protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may spoil well-formedness , which are sufficient conditions that guarantee a protocol to implementable. typing discipline enforces typed Then we unveil relation among and th...