pinecone/core-2020-05-10-deduplication huggingface dataset:
Reasoning with Bounded Cognitive Resources

Reasoning is an essential element of intelligence. Automated reasoning in formal and symbolic systems is a major topic in computer science and artificial intelligence (AI). Programs for computer-assisted and automated theorem proving are being constructed and used by mathematicians and logicians. Recently, there has been a surge in research in inductive reasoning systems. Inductive programming is an example of applying induction to symbolic systems. Most of the reasoning systems in AI are narrow and specialized to particular tasks and domains. Research work in artificial general intelligence (AGI) aims at producing models of AI that are fully or partially independent of task types. AGI systems are ideally able to learn new knowledge and rules that were not intended during their construction.

Automatic reasoning systems are traditionally developed by using heuristics to limit the computational resources. This thesis aims to produce models of easoning that use bounded cognitive resources. Since reasoning is a cognitive function, and human cognitive resources (such as working memory) are severely restricted, one possible method of reducing the computational complexity of reasoning systems is to introduce cognitive resources in the system and put limits on them similar to human cognitive limits. Another important aim of this thesis is to unite the deductive and inductive reasoning in symbolic systems, by using Occam's razor as a guiding principle for induction. The thesis uses an exploratory approach to search for a unified model of reasoning in arbitrary domains.

This thesis is a collection of published scientific papers, each contributing iteratively to the construction of a larger and domain-independent model of reasoning in symbolic domains. The first two papers present proof formalisms for first-order logic and description logic that produce comprehensible proofs. The second part comprises of five papers, each extending a model of inductive reasoning that can learn axioms of any arbitrary symbolic domain from random examples. Some of the models in the thesis were able to outstrip human performance in arithmetic, logic and number series problems. This is an interdisciplinary thesis that contributes to a number of scientific areas, mainly formal logic and AGI. Further research in this area can potentially lead to a universal reasoner that is able to learn and reason in more complex symbolic systems such as higher order logics and computer programming
Anchoring Knowledge in Interaction: Towards a Harmonic Subsymbolic/Symbolic Framework and Architecture of Computational Cognition

We outline a proposal for a research program leading to a new paradigm, architectural framework, and prototypical implementation, for the cognitively inspired anchoring of an agent’s learning, knowledge formation, and higher reasoning abilities in real-world interactions: Learning through interaction in real-time in a real environment triggers the incremental accumulation and repair of knowledge that leads to the formation of theories at a higher level of abstraction. The transformations at this higher level filter down and inform the learning process as part of a permanent cycle of learning through experience, higher-order deliberation, theory formation and revision.\ud
\ud
The envisioned framework will provide a precise computational theory, algorithmic descriptions, and an implementation in cyber-physical systems, addressing the lifting of action patterns from the subsymbolic to the symbolic knowledge level, effective methods for theory formation, adaptation, and evolution, the anchoring of knowledge-level objects, real-world interactions and manipulations, and the realization and evaluation of such a system in different scenarios. The expected results can provide new foundations for future agent architectures, multi-agent systems, robotics, and cognitive systems, and can facilitate a deeper understanding of the development and interaction in human-technological settings
Design of Web-based Tools to Study Blind People?s Touch-Based Interaction with Smartphones

Nowadays touchscreen smartphones are the most common kind of mobile devices. However, gesture-based interaction is a difficult task for most visually impaired people, and even more so for blind people. This difficulty is compounded by the lack of standard gestures and the differences between the main screen reader platforms available on the market. Therefore, our goal is to investigate the differences and preferences in touch gesture performance on smartphones among visually impaired people. During our study, we implemented a web-based wireless system to facilitate the capture of participants? gestures. In this paper we present an overview of both the study and the system used
Bioprinting with live cells

Tissue engineering is an emerging multidisciplinary field to regenerate damaged or diseased tissues and organs. Traditional tissue engineering strategies involve seeding cells into porous scaffolds to regenerate tissues or organs. However, there are still some challenges such as difficulty in seeding different type of cells spatially into a scaffold, limited oxygen and nutrient delivery and removal of metabolic waste from scaffold and weak cell-adhesion to scaffold material need to be overcome for clinically successful results. Because of those challenges, novel scaffold-free approaches based on cellular self-assembly or three-dimensional (3D) bioprinting have been recently pursued. Bioprinting is a relatively new technology where living cells with or without biomaterials are printed layer-by-layer in order to create 3D living structures. In 3D bioprinting, cell aggregates and hydrogels are termed as bioink used as building blocks that are placed by the bioprinter into precise architecture according to developed computer models. In this chapter, we focus on the scaffold-free, self-assembly based bioprinting approaches and some of the novel developments in this field. This chapter will also discuss the importance as well as the challenges for 3D bioprinting using stem cells. We aim to highlight the importance of the continuous cell printing in order to fabricate 3D biological structures with predefined shapes as being the building blocks of large and complex tissues
Cheeger inequalities for general edge-weighted directed graphs

LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, ProceedingsWe consider Cheeger Inequalities for general edge-weighted directed graphs. Previously the directed case was considered by Chung for a probability transition matrix corresponding to a strongly connected graph with weights induced by a stationary distribution. An Eulerian property of these special weights reduces these instances to the undirected case, for which recent results on multi-way spectral partitioning and higher-order Cheeger Inequalities can be applied.
We extend Chung’s approach to general directed graphs. In particular, we obtain higher-order Cheeger Inequalities for the following scenarios:
(1) The underlying graph needs not be strongly connected.
(2) The weights can deviate (slightly) from a stationary distribution.postprin
Dynamic tree shortcut with constant degree

LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, ProceedingsGiven a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(log n) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a leaf node or an internal node by sub-dividing an existing edge. For deletion, a leaf node can be deleted, or an internal node can be merged with its single child. We propose an algorithm that maintains a set of shortcut edges in O(log n) time for an insertion or deletion.postprin
SEPIA: Search for Proofs Using Inferred Automata

This paper describes SEPIA, a tool for automated proof\ud
generation in Coq. SEPIA combines model inference with interactive\ud
theorem proving. Existing proof corpora are modelled using state-based\ud
models inferred from tactic sequences. These can then be traversed automatically\ud
to identify proofs. The SEPIA system is described and its\ud
performance evaluated on three Coq datasets. Our results show that\ud
SEPIA provides a useful complement to existing automated tactics in\ud
Coq.Peer-reviewedPost-print25th International Conference on Automated Deduction (CADE-25), Berli
Quantomatic: A Proof Assistant for Diagrammatic Reasoning

Monoidal algebraic structures consist of operations that can have multiple
outputs as well as multiple inputs, which have applications in many areas
including categorical algebra, programming language semantics, representation
theory, algebraic quantum information, and quantum groups. String diagrams
provide a convenient graphical syntax for reasoning formally about such
structures, while avoiding many of the technical challenges of a term-based
approach. Quantomatic is a tool that supports the (semi-)automatic construction
of equational proofs using string diagrams. We briefly outline the theoretical
basis of Quantomatic's rewriting engine, then give an overview of the core
features and architecture and give a simple example project that computes
normal forms for commutative bialgebras.Comment: International Conference on Automated Deduction, CADE 2015 (CADE-25).
  The final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-319-21401-6_2
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited

International audienceThe Nelson-Oppen combination method is ubiquitous in Satisfiability  Modulo Theories solvers. However, one of its major drawbacks is to  be restricted to disjoint unions of theories.  We investigate the  problem of extending this combination method to particular  non-disjoint unions of theories connected via bridging functions.  The motivation is, e.g., to solve verification problems expressed in  a combination of data structures connected to arithmetic with  bridging functions such as the length of lists and the size of  trees.  We present a sound and complete combination procedure à la  Nelson-Oppen for the theory of absolutely free data structures,  including lists and trees.  This combination procedure is then  refined for standard interpretations.  The resulting theory has a  nice politeness property, enabling combinations with arbitrary  decidable theories of elements
A Uniform Substitution Calculus for Differential Dynamic Logic

This paper introduces a new proof calculus for differential dynamic logic
(dL) that is entirely based on uniform substitution, a proof rule that
substitutes a formula for a predicate symbol everywhere. Uniform substitutions
make it possible to rely on axioms rather than axiom schemata, substantially
simplifying implementations. Instead of nontrivial schema variables and
soundness-critical side conditions on the occurrence patterns of variables, the
resulting calculus adopts only a finite number of ordinary dL formulas as
axioms. The static semantics of differential dynamic logic is captured
exclusively in uniform substitutions and bound variable renamings as opposed to
being spread in delicate ways across the prover implementation. In addition to
sound uniform substitutions, this paper introduces differential forms for
differential dynamic logic that make it possible to internalize differential
invariants, differential substitutions, and derivations as first-class axioms
in dL
Termination competition (termCOMP 2015)

The termination competition focuses on automated termination analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. Moreover, the competition also features categories for automated complexity analysis. In all categories, the competition also welcomes the participation of tools providing certified proofs. The goal of the termination competition is to demonstrate the power of the leading tools in each of these areas.Peer ReviewedPostprint (author's final draft
A new competitive implementation of the electromagnetism-like algorithm for global optimization

The Electromagnetism-like (EM) algorithm is a population-
based stochastic global optimization algorithm that uses an attraction-
repulsion mechanism to move sample points towards the optimal. In
this paper, an implementation of the EM algorithm in the Matlab en-
vironment as a useful function for practitioners and for those who want
to experiment a new global optimization solver is proposed. A set of
benchmark problems are solved in order to evaluate the performance of
the implemented method when compared with other stochastic methods
available in the Matlab environment. The results con rm that our imple-
mentation is a competitive alternative both in term of numerical results
and performance. Finally, a case study based on a parameter estimation
problem of a biology system shows that the EM implementation could
be applied with promising results in the control optimization area.Acknowledgments This work has been supported by FCT (Funda¸c˜ao para a Ciˆencia e Tecnologia, Portugal) in the scope of the project PEst-UID/CEC/00319/2013
Solving constrained multilocal optimization problems with parallel stretched simulated annealing

Constrained multilocal programming optimization problems may be solved by solving a sequence of unconstrained problems. In turn, those unconstrained problems may be solved using techniques like the Stretched Simulated Annealing (SSA) method. In order to increase the solving performance and make possible the discovery of new optima, parallel approaches to SSA have been devised, like Parallel Stretched Simulated Annealing (PSSA). Recently, Constrained PSSA (coPSSA) was also proposed, coupling the penalty method with PSSA, in order to solve constrained problems. In this work, coPSSA is explored to solve four test problems using the l 1 penalty function. The effect of the variation of the reduction factor parameter of the l 1 penalty function is also studied.This work was been supported by FCT (Fundação para a
Ciência e Tecnologia) in the scope of the project UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio
Contribution of Geomatics Engineering and VGI Within the Landslide Risk Assessment Procedures

This paper presents a literature review on the methodology called Volunteered Geographic Information (VGI) and its use for Landslide Risk Assessment (LRA). General risk assessment procedures are discussed and the potential contributions of VGI are identified, in particular when quantitative characterization of factors such as Hazard, Vulnerability and Exposure is required. The review shows that the standard LRA procedures may benefit from input given by surveyors when performing hazard assessments, while crowdsourced data would be a valuable support in vulnerability/damage assessment studies. The review also highlights several limitations related to the role of VGI and crowdsourcing in LRA
Application of SLEUTH Model to Predict Urbanization Along the Emilia-Romagna Coast (Italy): Considerations and Lessons Learned

Coastal zone of Emilia-Romagna region, Italy, has been significantly urbanized during the last decades, as a result of a tourism development. This was the main motivation to estimate future trajectories of urban growth in the area. Cellular automata (CA)-based SLEUTH model was applied for this purpose, by using quality geographical dataset combined with relevant information on environmental management policy. Three different scenarios of urban growth were employed: sprawled growth scenario, compact growth scenario and a scenario with business-as-usual pattern of development. The results showed the maximum increase in urbanization in the area would occur if urban areas continue to grow according to compact growth scenario, while minimum was observed in case of more sprawled-like type of growth. This research goes beyond the domain of the study site, providing future users of SLEUTH detailed discussion on considerations that need to be taken into account in its applicatio
Adaptive Zoning for Efficient Transport Modelling in Urban Models

Transport modelling and in particular transport assignment is a well-known bottleneck in computation cost and time for urban system models. The use of Transport Analysis Zones (TAZ) implies a trade-off between computation time and accuracy: practical computational constraints can lead to concessions to zone size with severe repercussions for the quality of the transport representation in urban models. This paper investigates how a recently developed geographical topology called adaptive zoning can be used to obtain more favorable trade-offs between computational cost and accuracy than traditional TAZ. Adaptive zoning was developed specifically for representing spatial interactions; it makes use of a nested zone hierarchy to adapt the model resolution as a function of both the origin and destination location. In this paper the adaptive zoning method is tied to an approach to trip assignment that uses high spatial accuracy (small zones) at one end of the route and low spatial accuracy (large zones) at the other end of the route. Opportunistic use of either the first or second half of such routes with asymmetric accuracy profiles leads to a method of transport assignment that is more accurate than traditional TAZ based assignment at reduced computational cost. The method is tested and demonstrated on the well-known Chicago Regional test problem. Compared with an assignment using traditional zoning, an adaptive-zoning-based assignment that uses the same computation time reduces the bias in travel time by a factor 16 and link level traffic volume RMSE by a factor 6.4
Factorization in formal languages

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21500-6We consider several language-theoretic aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular\ud
if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L). We observe that uf(L) need not be context-free if L is context-free. Next, we consider some variations on unique factorization. We de ne a notion of \semi-unique" factorization, where every factorization has the same number of terms, and show that, if L is regular or even  nite, the set of words having such a factorization need not be context-free. Finally, we consider additional variations, such as unique factorization \up to permutation" and \up to subset". Although all these variations have\ud
been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up to now. We also consider the length of the shortest word not having the\ud
desired property
Weight Assignment Logic

We introduce a weight assignment logic for reasoning about quantitative
languages of infinite words. This logic is an extension of the classical MSO
logic and permits to describe quantitative properties of systems with multiple
weight parameters, e.g., the ratio between rewards and costs. We show that this
logic is expressively equivalent to unambiguous weighted B\"uchi automata. We
also consider an extension of weight assignment logic which is expressively
equivalent to nondeterministic weighted B\"uchi automata.Comment: This is the full version of the paper published at DLT 201
User extensible system to identify problems in OWL ontologies and SWRL rules

The Semantic Web uses ontologies to associate meaning to Web content so machines can process it. One inherent problem to this approach is that, as its popularity increases, there is an ever growing number of ontologies available to be used, leading to difficulties in choosing appropriate ones. With that in mind, we created a system that allows users to evaluate ontologies/rules. It is composed by the Metadata description For Ontologies/Rules (MetaFOR), an ontology in OWL, and a tool to convert any OWL ontology to MetaFOR. With the MetaFOR version of an ontology, it is possible to use SWRL rules to identify anomalies in it. These can be problems already documented in the literature or user defined ones. SWRL is familiar to users, so it is easier to define new project specific anomalies. We present a case study where the system detects 9 problems, from the literature, and two user defined ones.Coordination for the Improvement of Higher Education Personnel - CAPESInternational Symposium on Rule Technologies : Foundations, Tools, and Applications - RuleML (9. 2015 Berlin
An ontology for global production network design and reconfiguration

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21545-7_10Organisations constantly seek to improve and fully exploit global production networks. This can be to provide more competitive solutions to customer requests, to exploit potential new technologies or to consider new business models based on the servitisation of products. To support such decisions requires the interchange and evaluation of information from a wide range of different and varied sources. This paper puts forward a reference ontology aimed at supporting businesses who seek to design, configure and reconfigure global production networks. The aim of this is to support interoperability between information systems within multi-domain contexts
Social Innovations in the Urban Context

Contains fulltext :
                  170786.pdf (publisher's version ) (Open Access)This book addresses the practice of social innovation, which is currently very much in the public eye. New ideas and approaches are needed to tackle the severe and wicked problems with which contemporary societies are struggling. Especially in times of economic crisis, social innovation is regarded as one of the crucial elements needed to move forward. Our knowledge of its dynamics has significantly progressed, thanks to an abundance of studies on social innovation both general and sector-specific. However, despite the valuable research conducted over the past years, the systematic analysis of social innovation is still contested and incomplete. The questions asked in the book will be the following:
1. What is the nature of social innovations?
2.What patterns can be identified in social innovations emerging at the local level?
3.How is the emergence and spread of social innovations related to urban governance? More precisely, which conditions and arrangements facilitate and hinders social innovation?
We explore these questions using different types of data and methods, and studying different contexts. In particular, we focus on innovations that aim at solving problems of the young unemployed, single parents and migrants. This analysis is based on original research carried out in the period 2010-2013 in the framework of a European project with a specific empirical research strategy. Research was carried out in 20 cities in 10 different European countries