The partial lifting of U.S. metals tariffs slapped on Japan under former U.S. President Donald Trump's administration is the latest bid by U.S. President Joe Biden's government to mend ties with a major ally and counterbalance an increasingly powerful China. Biden inherited a global network of alliances that had been battered by Trump's repeated questioning of their value to the United States, even as many saw such ties as increasingly important, given China's growing wealth and military might. "First, you treat allies as allies," U.S. Ambassador to Japan Rahm Emanuel said in a phone interview Tuesday. "Second, you begin to make a down payment on both climate and standing up for a rules-based system by recognizing nonmarket forces like China have wreaked havoc." The deal on steel tariffs comes as the U.S. seeks to redefine its role in how trade policy is made in Asia following Trump's rejection of the Trans-Pacific Partnership regional trade pact his country once spearheaded.

The concept of "affordance" represents the relationship between human perceivers and their environment. Affordance perception, representation, and inference are central to commonsense reasoning, tool-use and creative problem-solving in artificial agents. Existing approaches fail to provide flexibility with which to reason about affordances in the open world, where they are influenced by changing context, social norms, historical precedence, and uncertainty. We develop a formal rules-based logical representational format coupled with an uncertainty-processing framework to reason about cognitive affordances in a more general manner than shown in the existing literature. Our framework allows agents to make deductive and abductive inferences about functional and social affordances, collectively and dynamically, thereby allowing the agent to adapt to changing conditions. We demonstrate our approach with an example, and show that an agent can successfully reason through situations that involve a tight interplay between various social and functional norms.

Stream reasoning is the task of continuously deriving conclusions on streaming data. As a research theme, it is targeted by different communities which emphasize different aspects, e.g., throughput vs. expressiveness. This thesis aims to advance the theoretical foundations underlying diverse stream reasoning approaches and to convert obtained insights into a prototypical expressive rule-based reasoning system that is lacking to date.

Stream reasoning is the task of continuously deriving conclusions on streaming data. To get results instantly one evaluates a query repeatedly on recent data chunks selected by window operators. However, simply recomputing results from scratch is impractical for rule-based reasoning with semantics similar to Answer Set Programming, due to the trade-off between complexity and data throughput. To address this problem, we present a method to efficiently update models of a rule set. In particular, we show how an answer stream (model) of a LARS program can be incrementally adjusted to new or outdated input by extending truth maintenance techniques. We obtain in this way a means towards practical rule-based stream reasoning with nonmonotonic negation, various window operators and different forms of temporal reference.

We consider existential rules (aka Datalog /-) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these classes cannot express transitivity of binary relations, a frequently used modelling construct. In this paper, we address the issue of whether transitivity can be safely combined with decidable classes of existential rules. First, we prove that transitivity is incompatible with one of the simplest decidable classes, namely aGRD (acyclic graph of rule dependencies), which clarifies the landscape of'finite expansion sets' of rules. Second, we show that transitivity can be safely added to linear rules (a subclass of guarded rules, which generalizes the description logic DL-LiteR) in the case of atomic CQs, and also for general CQs if we place a minor syntactic restriction on the rule set. This is shown by means of a novel query rewriting algorithm that is specially tailored to handle transitivity rules. Third, for the identified decidable cases, we pinpoint the combined and data complexities of query entailment.

Aspect extraction aims to extract fine-grained opinion targets from opinion texts. Recent work has shown that the syntactical approach, which employs rules about grammar dependency relations between opinion words and aspects, performs quite well. This approach is highly desirable in practice because it is unsupervised and domain independent. However, the rules need to be carefully selected and tuned manually so as not to produce too many errors. Although it is easy to evaluate the accuracy of each rule automatically, it is not easy to select a set of rules that produces the best overall result due to the overlapping coverage of the rules. In this paper, we propose a novel method to select an effective set of rules. To our knowledge, this is the first work that selects rules automatically. Our experiment results show that the proposed method can select a subset of a given rule set to achieve significantly better results than the full rule set and the existing state-of-the-art CRF-based supervised method.

Widely adopted for more than 20 years in industrial fields, business rules offer the opportunity to non-IT users to define decision-making policies in a simple and intuitive way. When used conjointly with probabilistic graphical models (PGM) their expressiveness increase by introducing the notion of probabilistic production rules (PPR). In this paper we will present a new model for PPR and suggest a way to handle the combinatorial explosion due to the number of parents of aggregators in PGM such as Bayesian Networks and Probabilistic Relational Models in an industrial context where marginals should be computed rapidly.

In this paper, we present a hybrid model that combines a neural conversational model and a rule-based graph dialogue system that assists users in scheduling reminders through a chat conversation. The graph based system has high precision and provides a grammatically accurate response but has a low recall. The neural conversation model can cater to a variety of requests, as it generates the responses word by word as opposed to using canned responses. The hybrid system shows significant improvements over the existing baseline system of rule based approach and caters to complex queries with a domain-restricted neural model. Restricting the conversation topic and combination of graph based retrieval system with a neural generative model makes the final system robust enough for a real world application.

The Synthesis of ACT-R and Leabra (SAL) hybrid cognitive architecture is the integration of two theories of cognitive functioning, each itself a highly integrative theory of cognition, ACT-R being predominantly a symbolic production-rule based architecture and Leabra a neural modeling architecture. The combination of the two architectures allows for richer dynamics that take advantage of neural and symbolic aspects and provides mutual constraints that promote convergence towards models that are both neurophysiologically and psychologically valid. We present a hybrid model that makes use of multi-level and multi-system integration to allow an instructed assembly task to be carried out in way that is noise and error robust. Specifically, the model shows how higher-level error recovery routines can interface with lower-level sensory, motor, and error detection processes and result in a robustness to noise and noise-induced errors. Multiple systems and processes operating at multiple levels are recruited to provide a way around the limitations of simpler systems composed of isolated modules that do not allow information to be propagated as easily. The benefits of this approach provide motivation for the adoption of a generally integrated approach to cognitive systems.

The Expressive Intelligence Studio is developing a new approach to freeform conversational interaction in playable media that combines dialogue management, natural language generation (NLG), and natural language understanding. In this paper, we present our method for dialogue generation, which has been fully implemented in a game we are developing called Talk of the Town. Eschewing a traditional NLG pipeline, we take up a novel approach that combines human language expertise with computer generativity. Specifically, this method utilizes a tool that we have developed for authoring context-free grammars (CFGs) whose productions come packaged with explicit metadata. Instead of terminally expanding top-level symbols -- the conventional way of generating from a CFG -- we employ an unusual middle-out procedure that targets mid-level symbols and traverses the grammar by both forward chaining and backward chaining, expanding symbols conditionally by testing against the current game state. In this paper, we present our method, discuss a series of associated authoring patterns, and situate our approach against the few earlier projects in this area.