Consistent disjunctive sequent calculi and Scott domains

Based on the framework of disjunctive propositional logic, we first provide a syntactic representation for Scott domains. Precisely, we establish a category of consistent disjunctive sequent calculi with consequence relations, and show it is equivalent to that of Scott domains with Scott-continuous functions. Furthermore, we illustrate the approach to solving recursive domain equations by introducing some standard domain constructions, such as lifting and sums. The subsystems relation on consistent finitary disjunctive sequent calculi makes these domain constructions continuous. Solutions to recursive domain equations are given by constructing the least fixed point of a continuous function.

Logikôs Argumentation in Aristotle’s Natural Science

This paper offers a novel interpretation of the nature and role of logical (logikôs) argumentation in Aristotle’s natural philosophy. In contrast to the standard domain interpretation, which makes logikôs argumentation the contrary of phusikôs, relying on principles drawn from outside the domain of natural science, I propose that the essential or defining feature of logikôs argumentation is the use of principles that are general relative to the question under investigation. My interpretation is developed and illustrated with a close textual analysis of Aristotle’s explanation of mule sterility in Generation of Animals II 8.

Reciprocal power GCDQ matrices and power LCMQ matrices defined on factor closed sets over Euclidean domains

In this paper, we use a generalized form for the Jordan totient function in order to extend the Reciprocal power GCDQ matrices and power LCMQ matrices from the standard domain of natural integers to Euclidean domains. Structural theorems and determinantal arguments defined on both arbitrary and factor-closed q-ordered sets are presented over such domains. We illustrate our work in the case of Gaussian integers.

Transferable Attention for Domain Adaptation

Recent work in domain adaptation bridges different domains by adversarially learning a domain-invariant representation that cannot be distinguished by a domain discriminator. Existing methods of adversarial domain adaptation mainly align the global images across the source and target domains. However, it is obvious that not all regions of an image are transferable, while forcefully aligning the untransferable regions may lead to negative transfer. Furthermore, some of the images are significantly dissimilar across domains, resulting in weak image-level transferability. To this end, we present Transferable Attention for Domain Adaptation (TADA), focusing our adaptation model on transferable regions or images. We implement two types of complementary transferable attention: transferable local attention generated by multiple region-level domain discriminators to highlight transferable regions, and transferable global attention generated by single image-level domain discriminator to highlight transferable images. Extensive experiments validate that our proposed models exceed state of the art results on standard domain adaptation datasets.

Impossibility in Belief Merging (Extended Abstract)

With the aim of studying social properties of belief merging and having a better understanding of impossibility, we extend in three ways the framework of logic-based merging introduced by Konieczny and Pino Perez. First, at the level of representation of the information, we pass from belief bases to complex epistemic states. Second, the profiles are represented as functions of finite societies to the set of epistemic states (a sort of vectors) and not as multisets of epistemic states. Third, we extend the set of rational postulates in order to consider the epistemic versions of the classical postulates of social choice theory: standard domain, Pareto property, independence of irrelevant alternatives and absence of dictator. These epistemic versions of social postulates are given, essentially, in terms of the finite propositional logic. We state some representation theorems for these operators. These extensions and representation theorems allow us to establish an epistemic and very general version of Arrow's impossibility theorem. One of the interesting features of our result, is that it holds for different representations of epistemic states; for instance conditionals, ordinal conditional functions and, of course, total preorders.

Recursive Definitions of Monadic Functions

Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define.For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

Research on Standard Domain and Non Standard Domain Based on SIP Protocol

SIP protocol is a for the establishment, change and terminate multimedia session control protocol of application layer, based on the analysis of SIP protocol stack, in view of the non SIP video communication field has designed a communication strategy, achieved with the standard SIP domain as well as the standard SIP device and the existing non SIP domain communication, makes SIP protocol is compatible with existing video scheduling system, enhances the use range, avoid re design of non SIP domain, and the validation and application in the bus company project.

Concept Presentation Conversion for Cooperative Information Engineering

Concept integration, connection, and reuse are at the heart of Web services. The connection between two concepts can be achieved easily provided both share the same theorematic space. This in turn can be achieved by reusing constructs from foundational concepts and standard domain theme. Although the current produce of concept development methods and tools have made it a lot easier to build a new concept, reusing concepts from existing concepts remains difficult. The main reasons for this are the uncertainty in presentation conversions of concepts from foundational concepts. In this paper we have introduced a novel method for sense certainty to help the human expert in presentation conversion.

MORE ON GENERAL p-BRANE SOLUTIONS

Recently it was found that the complete integration of the Einstein-dilaton-antisymmetric form equations depending on one variable and describing static singly charged p-branes leads to two and only two classes of solutions: the standard asymptotically flat black p-brane and the asymptotically nonflat p-brane approaching the linear dilaton background at spatial infinity. Here we analyze this issue in more details and generalize the corresponding uniqueness argument to the case of partially delocalized branes. We also consider the special case of codimension one and find, in addition to the standard domain wall, the black wall solution. Explicit relations between our solutions and some recently found p-brane solutions "with extra parameters" are presented.

HOLCF = HOL + LCF

HOLCF is the definitional extension of Church's Higher-Order Logic with Scott's Logic for Computable Functions that has been implemented in the theorem prover Isabelle. This results in a flexible setup for reasoning about functional programs. HOLCF supports standard domain theory (in particular fixpoint reasoning and recursive domain equations), but also coinductive arguments about lazy datatypes. This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.