نتایج جستجو برای: inter sentential switching
تعداد نتایج: 191232 فیلتر نتایج به سال:
Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing the implicational equivalences of various formulations of the sentential calculi is foundational to the study of logic. Using an automated deduction system, I show that Łukasiewicz's CN sentential calculus can be derived from Church's P2; the proof appears to be novel.
Online measurement of sentential comprehension: • Participants completed an experimental task modeled after Kamide, Altmann and Haywood (2003). • In this task, (see Figure 1) participants hear simple, fiveword sentences containing an Agent, Action and Object as they view images containing four objects. • Eye movements were simultaneously recorded. • The task is to select the image that correspo...
We propose a novel switching control law for the posture stabilization of a wheeled mobile robot, that utilizes the (energetic) passivity of the system's open-loop dynamics with non-negligible inertial effects. The proposed passivity-based switching control law ensures that the robot's (x, y)-position enters into an arbitrarily small (as speci ed by user-designed error-bound) level set of a cer...
PIM-SM is the only deployed intra-domain multicast routing protocol that builds both shared and source-based trees. However, it does not provide an efficient mechanism to switch between the two modes. The PIM-SM switching mechanism proposed in this paper aims to improve both network and receivers requirements. It is a coordination-based mechanism in the sense that all concerned receivers contri...
Four experiments examined the strategies that individuals develop in sentential reasoning. They led to the discovery of five different strategies. According to the theory proposed in the paper, each of the strategies depends on component tactics, which all normal adults possess, and which are based on mental models. Reasoners vary their use of tactics in ways that have no deterministic account....
We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and canonical representation of probability distributions defined over the models of a given propositional theory. Each parameter of a PSDD can be viewed as the (conditional) probability of making a decision in a corresponding Sentential Decision Diagram (SDD). The SDD itself is a recently proposed complete and canonica...
We consider the problem of checking whether an organization conforms to a body of regulation. Conformance is studied in a runtime verification setting. The regulation is translated to a logic, from which we synthesize monitors. The monitors are evaluated as the state of an organization evolves over time, raising an alarm if a violation is detected. An important challenge to this approach comes ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید