Parallelization of Logical Inference for Confluent Rule-based System

* This paper was made according to the program № 14 of fundamental scientific research of the Presidium of the Russian Academy of Sciences, the project 06-I-П14-052

Using a logical model to predict the growth of yeast

Whelan, K. E. and King, R. D. Using a logical model to predict the growth of yeast. BMC Bioinformatics 2008, 9:97

Logical omniscience as infeasibility

Logical theories for representing knowledge are often plagued by the so-called Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a quantitative solution to the problem compatible with the two important facets of the reasoning agent: rationality and resource boundedness. More precisely, we provide a test for the logical omniscience problem in a given formal theory of knowledge. The quantitative measures we use are inspired by the complexity theory. We illustrate our framework with a number of examples ranging from the traditional implicit representation of knowledge in modal logic to the language of justification logic, which is capable of spelling out the internal inference process. We use these examples to divide representations of knowledge into logically omniscient and not logically omniscient, thus trying to determine how much information about the reasoning process needs to be present in a theory to avoid logical omniscience.

Temporal management using relative time in knowledge-based process control

In this paper, a knowledge-based approach is proposed for the management of temporal information in process control. A common-sense theory of temporal constraints over processes/events, allowing relative temporal knowledge, is employed here as the temporal basis for the system. This theory supports duration reasoning and consistency checking, and accepts relative temporal knowledge which is in a form normally used by human operators. An architecture for process control is proposed which centres on an historical database consisting of events and processes, together with the qualitative temporal relationships between their occurrences. The dynamics of the system is expressed by means of three types of rule: database updating rules, process control rules, and data deletion rules. An example is provided in the form of a life scheduler, to illustrate the database and the rule sets. The example demonstrates the transitions of the database over time, and identifies the procedure in terms of a state transition model for the application. The dividing instant problem for logical inference is discussed with reference to this process control example, and it is shown how the temporal theory employed can be used to deal with the problem.

A definição de mercados relevantes no direito europeu e português da concorrência : teoria e prática

Tese de doutoramento, Direito (Ciências Jurídico-Económicas), Universidade de Lisboa, Faculdade de Direito, 2014

Distributed intelligent management of active networks

This paper focuses on improving computer network management by the adoption of artificial intelligence techniques. A logical inference system has being devised to enable automated isolation, diagnosis, and even repair of network problems, thus enhancing the reliability, performance, and security of networks. We propose a distributed multi-agent architecture for network management, where a logical reasoner acts as an external managing entity capable of directing, coordinating, and stimulating actions in an active management architecture. The active networks technology represents the lower level layer which makes possible the deployment of code which implement teleo-reactive agents, distributed across the whole network. We adopt the Situation Calculus to define a network model and the Reactive Golog language to implement the logical reasoner. An active network management architecture is used by the reasoner to inject and execute operational tasks in the network. The integrated system collects the advantages coming from logical reasoning and network programmability, and provides a powerful system capable of performing high-level management tasks in order to deal with network fault.

Criatividade em uma perspectiva estético-cognitiva

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Mixed Theories

In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in the formalized language. For these rules we introduce some conclusion procedure. In such a way we make small theories for restricted fields of the knowledge. The most important procedure is the mixing of these partial knowledge systems. In that step we glue the theories together and eliminate the contradictions. The last operation is the most complicated one and some simplifying procedures are proposed.

The Development of Parallel Resolution Algorithms Using the Graph Representation

The parallel resolution procedures based on graph structures method are presented. OR-, AND- and DCDP- parallel inference on connection graph representation is explored and modifications to these algorithms using heuristic estimation are proposed. The principles for designing these heuristic functions are thoroughly discussed. The colored clause graphs resolution principle is presented. The comparison of efficiency (on the Steamroller problem) is carried out and the results are presented. The parallel unification algorithm used in the parallel inference procedure is briefly outlined in the final part of the paper.

Admissible Substitutions in Sequent Calculi

For first-order classical logic a new notion of admissible substitution is defined. This notion allows optimizing the procedure of the application of quantifier rules when logical inference search is made in sequent calculi. Our objective is to show that such a computer-oriented sequent technique may be created that does not require a preliminary skolemization of initial formulas and that is efficiently comparable with methods exploiting the skolemization. Some results on its soundness and completeness are given.

El daño y el nexo causal en la perdida de oportunidad

El presente escrito se ocupa de estudiar el nexo de causalidad como elemento estructural de la responsabilidad cuando éste es difuso. Para ello, se pretende abordar la pérdida de la oportunidad como una teoría especial de causalidad que tiene lugar cuando el nexo causal no resulta claro, lo cual contradice la tesis preponderante de la doctrina y la jurisprudencia tradicional según la cual, la pérdida de la oportunidad es un criterio autónomo del daño. En su contenido se realiza una explicación del por qué se entiende la pérdida de la oportunidad como una teoría especial de causalidad y no como un criterio autónomo de daño, haciendo énfasis en el elemento de certeza que caracteriza al daño. Posteriormente, se advierte del tratamiento que la jurisprudencia le ha dado a la pérdida de la oportunidad. A su turno, el presente documento, indica la naturaleza jurídica de la pérdida de la oportunidad, afirmando que es una inferencia lógica que realiza el juez y no un hecho que altere el estado de las cosas como si sucede con el daño. Finalmente, se aborda la prueba de la teoría de la pérdida de la oportunidad mediante un cálculo de probabilidades y se identifican los pasos para realizar una adecuada reparación integral.

The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages

We study the computational complexity of finding maximum a posteriori configurations in Bayesian networks whose probabilities are specified by logical formulas. This approach leads to a fine grained study in which local information such as context-sensitive independence and determinism can be considered. It also allows us to characterize more precisely the jump from tractability to NP-hardness and beyond, and to consider the complexity introduced by evidence alone.

Inference and Labeling of Metric-Induced Network Topologies

The development and deployment of distributed network-aware applications and services over the Internet require the ability to compile and maintain a model of the underlying network resources with respect to (one or more) characteristic properties of interest. To be manageable, such models must be compact, and must enable a representation of properties along temporal, spatial, and measurement resolution dimensions. In this paper, we propose a general framework for the construction of such metric-induced models using end-to-end measurements. We instantiate our approach using one such property, packet loss rates, and present an analytical framework for the characterization of Internet loss topologies. From the perspective of a server the loss topology is a logical tree rooted at the server with clients at its leaves, in which edges represent lossy paths between a pair of internal network nodes. We show how end-to-end unicast packet probing techniques could b e used to (1) infer a loss topology and (2) identify the loss rates of links in an existing loss topology. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. We report on simulation, implementation, and Internet deployment results that show the effectiveness of our approach and its robustness in terms of its accuracy and convergence over a wide range of network conditions.

The story of some: Everyday pragmatic inference by children and adults

The statement, some elephants have trunks, is logically true but pragmatically infelicitous. Whilst some is logically consistent with all, it is often pragmatically interpreted as precluding all. In Experiments 1 and 2, we show that with pragmatically impoverished materials, sensitivity to the pragmatic implicature associated with some is apparent earlier in development than has previously been found. Amongst 8-year-old children, we observed much greater sensitivity to the implicature in pragmatically enriched contexts. Finally, in Experiment 3, we found that amongst adults, logical responses to infelicitous some statements take longer to produce than do logical responses to felicitous some statements, and that working memory capacity predicts the tendency to give logical responses to the former kind of statement. These results suggest that some adults develop the ability to inhibit a pragmatic response in favour of a logical answer. We discuss the implications of these findings for theories of pragmatic inference.