ABSTRACT Real-time graphical interval logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automted deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the logic and produces counterexamples to invalid proofs. (...) The user interface includes a graphical editor that enables the user to create graphical formulas on a workstation display, and a database and proof manager that tracks proof dependencies and allows graphical formulas to be stored and retrieved. In this paper we describe the logic, the automated deduction system, and an application to robotics. (shrink)

This paper concerns the paraconsistent logic LPQ⊃,F and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without resort to database (...) repairs. In an earlier paper, LPQ⊃,F is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented instead because such proof systems are generally considered more suitable as the basis of proof search procedures than natural deduction proof systems and proof search procedures can serve as the core of algorithms for computing consistent answers to queries. (shrink)

Introduction. According to the well-established opinion of specialists in social sciences and humanities, a person diffracts his selves in the modern world: real spaces (professions, statuses) and virtual (accounts, profiles). In the diffraction of a person through spaces of different order, each “new” self acquires relative autonomy (a trace of the self in the network, which is present regardless of the attitude to it), and at the same time there remains the connection that, as it were, keeps the self with (...) his digital images and “prints”. The main questions of the article are: in what relation and in relation to what is it possible to talk about the identity of a modern person; what fundamentally significant do the researches on human identity give us today; what do those who ask questions about personal identity in the digital age focus their attention on? In order to answer these questions, let us turn to scientific articles from domestic and foreign journals. This article presents the analytics of publications from Scopus and RSCI databases, in which the problem of personal identity is posed. The purpose of the article is to analyze scientific publications on human identity and summarize the main ideas presented in those publications. Methods. The research is based on general scientific methods, analysis and synthesis, induction, deduction, and abstraction. The author analyzes scientific publications on the basis of the interpretation method and a systematic approach method. Content analysis was used as a method, but it was used within the scope of the purpose. The publications were selected on the basis of the authors’ research of various aspects of identity and the difference in interpreting the phenomenon. Results. Analysis of Scopus publications made it possible to assert that the problem of identity is moving out of the anthropological context and acquiring new technical and technological frameworks (for example, scholars are raising the problem of the digital data identity, digital identification in the context of online transactions). At the same time, the anthropological view of identity remains. It is found for instance in the context of narratives, texts of a person about self that are posted on the Internet. In this context, the concept of “Person Life View” (M. Schechtman) is presented as a variant of a person’s holistic view of the self. The analysis of domestic publications makes it possible to conclude that representatives of social sciences and humanities in their research strive to overcome the dynamic view of a person (dissolving of identity or an absent self), are in search of models of “stability” of identity. Conclusion. Posing the question about the personal identity of a modern person, it seems that the border between the directly human (consciousness and body, for example) and the technical and technological (the Internet and the objective world) is becoming more and more destabilized every day. This predetermines the direction of the research. Contemporary scholars, who publish the results of their work in journals included in scientific databases, are faced not only with the problem of substantiating human identity as a theoretical concept that reflects the modern situation, but also with the problem of finding models in which a person is able to embody the idea of “stability” of identity in the everyday life. (shrink)

Using the LDSNL model of utterance interpretation being developed by Gabbay and Kempson , this paper demonstrates how the dynamics of the proof process adopted explains configurational restrictions imposed on the interpretation of elliptical fragments. The blurring of traditional semantic and syntactic dichotomies in the LDSNL proof-theoretic reconstruction of interpretation successfully provides a basis for predicting the array of variation displayed by different elliptical forms. The logic adopted is a composite system of a type logic nested within a database logic. (...) Two resource-sensitive sub-types of Conditional Introduction form the basis for explaining the ellipsis data. The result is a demonstration of how the simple device of adding labels to an inference system can provide a useful tool not only at the meta-logic level of comparing alternative logic and grammar formalisms, but also at the level of explaining natural language data. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense reasoning, expert systems implementation, (...) deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

A hypothetical reasoning, which can find an explanation for a given set of observation by assuming some hypothetical sets, is a useful knowledge processing framework because of its theoretical basis and usefulness for practical problems such as diagnostics, scheduling, and design. It is, however, known to be computationally very expensive for large problems because it must deal with incomplete knowledge. Predicate-logic allows powerful and compact knowledge representation compared to propositional-logic. Efficient methods to proceed reasoning have been developed for propositional-logic. However (...) it would be desirable to develop similar methods for predicate-logic, but this has so far proved difficult. “KICK-HOPE” is one of hypothetical reasoning systems for predicate-logic. KICK-HOPE, which is based on a deductive database technique called the QSQR method and a basic fast hypothetical reasoning system called ATMS, made advances in the speed of reasoning. However, for a practical knowledge base, ‘the inconsistent process’ and ‘the subsumption process’ still consume much calculation time. In this paper, we investigate an e.cient method of the inconsistent and subsumption processes of KICK-HOPE. First, we show most of these processes are vain and omissible. Second, to omit vain processes, we introduce bit-vector to represent what hypotheses include in hypothetical sets. And, we improve that vain processes will be reduced to check the check-vector. Finally, we examine the proposed system with two examples, a diagnostic problem of a logic circuit and a scheduling problem. It is shown to be more efficient than the original KICK-HOPE for all problems. (shrink)

The closed world assumption plays a fundamental role in the theory of deductive databases. On the other hand, multi-valued logics occupy a vast field in non-classical logics. Some questions are better explained and expressed in terms of such logics. To enhance the expressive power and the declarative ability of a deductive database, we extend various CWA formalizations, including the naive CWA, the generalized CWA and the careful CWA, to multi-valued logics. The basic idea is to embed logic (...) formulae into some polynomial ring. The extensions can be applied in a uniform manner to any finitely multi-valued logics. Therefore they have also computational interest. (shrink)

Includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. September 2-6, 1996, Bonn, Germany Every four years, the two major international scientific conferences on logic programming merge in one joint event. JICSLP'96 is the thirteenth in the two series of annual conferences sponsored by The Association for Logic Programming. It includes tutorials, invited lectures, and refereed papers on all (...) aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. The contributors are international, with strong contingents from the United States, United Kingdom, France, and Japan. Logic Programming series, Research Reports and Notes. (shrink)

This thesis analyzes from a philosophical perspective different models for nonmonotonic inference, belief revision and the handling of inconsistencies. ;The first chapter serves as an introduction to the subject, giving examples and analyzing the main concepts. As a result of these discussions, this thesis tries to: produce a refined map of the main notions related to this subject, maintain that there can be a fault tolerant logic that stands in support of fault tolerant reasoning, and defend the use of (...) class='Hi'>deductive databases as models for changes of belief. ;The second chapter explores monotonic proposals to deal with uncertain reasoning. These include logics based on a classical notion of consequence, interpretations of defeasible reasoning as containing implicit premises, and systems in which temporal change is an integral part of the representation of states of affairs, via temporal indices or more elaborate devices. ;The third chapter explores quantitative approaches to nonmonotonic reasoning like dispositional logic, and theories of probabilistic reasoning including Bayesian, certainty factors, and Dempster-Shafer. ;The fourth chapter explores qualitative approaches. Here we mention conditional, default, and nonmonotonic logics, and the circumscription and autoepistemic formalisms. ;The fifth chapter studies different proposals to deal with contradictions. It starts with a review of the types of belief inconsistencies, and then it presents mechanisms to prevent, control or correct them. I explore paraconsistent logics, specially relevance logics, to "bracket" the area of conflict and allow inferences about non-related topics to continue unaffected. Then I examine different methods to get rid of the inconsistencies, including the use of dependency-directed backtracking and of relevance logic. ;Finally, I present my conclusions, and mention some of the open problems. (shrink)

These two volumes collect papers presented at the first joint meeting of the two principal logic programming conferences, held in August of 1988. The more than fifty contributions cover all aspects of the field, including applications (particularly those that exploit the unique character of logic programming), the role of logic programming in artificial intelligence, deductive databases, relations to other computational paradigms, language issues, methodology, implementations on sequential and parallel architectures, and theory.Logic Programming is included in the Logic Programming (...) series Research Reports and Notes, edited by Ehud Shapiro. (shrink)

Since its conception nearly 20 years ago, Logic Programming - the idea of using logic as a programming language - has been developed to the point where it now plays an important role in areas such as database theory, artificial intelligence and software engineering. However, there are still many challenging research issues to be addressed and the UK branch of the Association for Logic Programming was set up to provide a forum where the flourishing research community could discuss important issues (...) of Logic Programming which were often by-passed at the large international conferences. This volume contains the twelve papers which were presented at the ALPUK's 3rd conference which was held in Edinburgh, 10-12 April 1991. The aim of the conference was to give a broad but detailed technical insight into the work currently being done in this field, both in the UK and by researchers as far afield as Canada and Bulgaria. The breadth of interest in this area of Computer Science is reflected in the range of the papers which cover - amongst other areas - massively parallel implementation, constraint logic programming, circuit modelling, algebraic proof of program properties, deductive databases, specialised editors and standardisation. The resulting volume gives a good overview of the current progress being made in the field and will be of interest to researchers and students of any aspects of logic programming, parallel computing or database techniques and management. (shrink)

In the context of the emerging Semantic Web and the quest for a common logical framework underpinning its architecture, the relation of rule-based languages such as Answer Set Programming (ASP) and ontology languages such as the Web Ontology Language (OWL) has attracted a lot of attention in the literature over the past years. With its roots in Deductive Databases and Datalog though, ASP shares much more commonality with another Semantic Web standard, namely the Simple Protocol and RDF Query (...) Language (SPARQL). In this paper, we take the recent approval of the SPARQL1.1 standard by the World Wide Web consortium (W3C) as an opportunity to introduce this standard to the Logic Programming community by providing a translation of SPARQL1.1 into ASP. In this translation, we explain and highlight peculiarities of the new W3C standard. Along the way, we survey existing literature on foundations of SPARQL and SPARQL1.1, and also combinations of SPARQL with ontology and rules languages. Thereby, apart from providing the means to implement and support SPARQL natively within Logic Programming engines and particularly ASP engines, we hope to pave the way for further research on a common logical framework for Semantic Web languages, including query languages, from an ASP point of view. (shrink)

ABSTRACT This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet it is hard (...) to be expressed with a set of integrity constraints. We handle safe negation and local variables in the bodies of the rules. We tackle the issue of modifying the active domain (i.e. adding new constants or removing some of the constants which are present in the knowledge base), and we demonstrate how interaction with the user can be used to handle recursive definitions. (shrink)

In this paper, we set out to investigate the following question: if science relies heavily on induction, does philosophy of science rely heavily on induction as well? Using data mining and text analysis methods, we study a large corpus of philosophical texts mined from the JSTOR database (n = 14,199) in order to answer this question empirically. If philosophy of science relies heavily on induction, just as science supposedly does, then we would expect to find significantly more inductive arguments than (...) deductive arguments and abductive arguments in the published works of philosophers of science. Using indicator words to classify arguments by type (namely, deductive, inductive, and abductive arguments), we search through our corpus to find patterns of argumentation. Overall, the results of our study suggest that philosophers of science do rely on inductive inference. But induction may not be as foundational to philosophy of science as it is thought to be for science, given that philosophers of science make significantly more deductive arguments than inductive arguments. Interestingly, our results also suggest that philosophers of science do not rely on abductive arguments all that much, even though philosophers of science consider abduction to be a cornerstone of scientific methodology. (shrink)

. We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the interpolation and the deduction property induces an information algebra. Conversely, each finitary information algebra can be obtained from a consequence operator in this way. (...) Finally we show that arbitrary (not necessarily finitary) information algebras can be represented as some kind of abstract relational database called a tuple system. (shrink)

Science and engineering rely on the accumulation and dissemination of knowledge to make discoveries and create new designs. Discovery-driven genome research rests on knowledge passed on via gene annotations. In response to the deluge of sequencing big data, standard annotation practice employs automated procedures that rely on majority rules. We argue this hinders progress through the generation and propagation of errors, leading investigators into blind alleys. More subtly, this inductive process discourages the discovery of novelty, which remains essential in biological (...) research and reflects the nature of biology itself. Annotation systems, rather than being repositories of facts, should be tools that support multiple modes of inference. By combining deduction, induction and abduction, investigators can generate hypotheses when accurate knowledge is extracted from model databases. A key stance is to depart from ‘the sequence tells the structure tells the function’ fallacy, placing function first. We illustrate our approach with examples of critical or unexpected pathways, using MicroScope to demonstrate how tools can be implemented following the principles we advocate. We end with a challenge to the reader. (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by (...) researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (shrink)

Philosophy is often divided into two traditions: analytic and continental philosophy. Characterizing the analytic-continental divide, however, is no easy task. Some philosophers explain the divide in terms of the place of argument in these traditions. This raises the following questions: Is analytic philosophy rife with arguments while continental philosophy is devoid of arguments? Or can different types of arguments be found in analytic and continental philosophy? This paper presents the results of an empirical study of a large corpus of philosophical (...) texts mined from the JSTOR database (n = 53,260) designed to find patterns of argumentation by type. Overall, the results suggest that there are no significant differences between the types of arguments advanced in analytic and continental philosophy journal articles. The findings, therefore, provide no empirical support to the hypothesis that the divide between analytic and continental philosophy has to do with the place of argument in these traditions. (shrink)

Drawing on the epistemology of logic literature on anti-exceptionalism about logic, we set out to investigate the following metaphilosophical questions empirically: Is philosophy special? Are its methods (dis)continuous with science? More specifically, we test the following metaphilosophical hypotheses empirically: philosophical deductivism, philosophical inductivism, and philosophical abductivism. Using indicator words to classify arguments by type (namely, deductive, inductive, and abductive arguments), we searched through a large corpus of philosophical texts mined from the JSTOR database (N = 435,703) to find patterns (...) of argumentation. The results of our quantitative, corpus-based study suggest that deductive arguments are significantly more common than abductive arguments and inductive arguments in philosophical texts overall, but they are gradually and steadily giving way to non-deductive (i.e. inductive and abductive) arguments in academic philosophy. (shrink)

Background International electives are often considered a valuable learning opportunity for medical students. Yet, as travelling to lower and middle income countries (LMICs) becomes more common, ethical considerations of such practices emerge. We conducted a scoping review to assess the extent to which five ethical themes were addressed in existing literature about electives, with the aim of investigating the ethical impacts of medical student electives on local resources, patients and clinicians in LMICs. Methods We systematically searched PubMed, Global Health and (...) Embase databases using the search terms “(ethics) AND (medical electives)”. Thematic content analysis was undertaken using a combination of deductive and inductive themes. The deductive themes included: exceeding clinical competence, use of limited local resources, respect for patients and local culture, collaboration with local community/colleagues, and one-sided benefits in partnership. In addition, we also allowed for emerging themes within the data, and conducted a narrative synthesis of the results. Results A total of 37 papers discussed ethical issues relating to medical student international electives to LMICs. More publications were written from the medical student perspective (n = 14), than by the host-institution (n = 5), with nearly half written from third-party perspectives (n = 18). Negative impacts on local host students and impact upon patient care were identified as additional ethical considerations. Conclusions Our review demonstrated that while there is a degree of awareness in the existing literature of the potential negative impacts of medical electives to local LMIC students’ access to medical education and patient care, continued work is needed to ensure equitable partnerships. We recommend that these ethical themes should be further explored in pre-departure elective teaching courses and post-elective debriefs to increase medical students’ awareness of the impact of their presence on host communities. (shrink)

We present a logic for reasoning about attribute dependencies in data involving degrees such as a degree to which an object is red or a degree to which two objects are similar. The dependencies are of the form A ⇒ B and can be interpreted in two ways: first, in data tables with entries representing degrees to which objects have attributes ; second, in database tables where each domain is equipped with a similarity relation. We assume that the degrees form (...) a scale equipped with operations representing many-valued logical connectives. If 0 and 1 are the only degrees, the algebra of degrees becomes the two-element Boolean algebra and the two interpretations become well-known dependencies in Boolean data and functional dependencies of relational databases. In a setting with general scales, we obtain a new kind of dependencies with naturally arising degrees of validity, degrees of entailment, and related logical concepts. The deduction rules of the proposed logic are inspired by Armstrong rules and make it possible to infer dependencies to degrees—the degrees of provability. We provide a soundness and completeness theorem for such a setting asserting that degrees of entailment coincide with degrees of provability, prove the independence of deduction rules, and present further observations. (shrink)

To reduce global greenhouse gas emissions in order to limit global warming to 1.5°C, individuals and households play a key role. Behavior change interventions to promote pro-environmental behavior in individuals are needed to reduce emissions globally. This systematic literature review aims to assess the a) evidence-based effectiveness of such interventions and b) the content of very successful interventions without limiting the results to specific emitting sectors or countries. Based on the “PICOS” mnemonic and PRISMA statement, a search strategy was developed, (...) and eligibility criteria were defined. Three databases were searched to retrieve and review potential literature. As a result, 54 publications from 2010 to 2021 were included in the analysis. The results show that most interventions only have small positive effects or none at all. A total of 15 very successful interventions focused on the sectors of mobility, energy, and waste and incorporated improved structures, education, feedback, enablement or made the sustainable option the default. Six evidence-based recommendations for content, timing, and setting are deducted and given for interventions on enhancing pro-environmental behavior. In summary, although the various interventions and intervention types to promote PEB differ in their effectiveness, very successful interventions have common elements. Future research should focus on high-/low-impact and high-/low-cost behavior to develop interventions that aim at high-impact but low-cost behavior changes, or avoid low-impact but high-cost behavior. (shrink)

This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage , the database is ¡£¢ , receiving the input ¤ ¢ . The revision algorithms for moving to the new database ¡ ¢¦¥¨§© ¡ ¢ ¤ ¢ take into account the history of previous revisions actually executed as well as possible revision options which were discarded at the time but may now be pursued. The appropriate methodology for carrying this out is (...) Labelled Deductive Systems. (shrink)

K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement (...) setting, we model the information flow between different states of a single agent as that agent reasons deductively. The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the residuated structure that encodes the nonassociative Lambek Calculus with permutation, bottom, and identity: NLP01. (shrink)

While the empirical evidence pointing to a gender gap in professional, academic philosophy in the English-speaking world is widely accepted, explanations of this gap are less so. In this paper, we aim to make a modest contribution to the literature on the gender gap in academic philosophy by taking a quantitative, corpus-based empirical approach. Since some philosophers have suggested that it may be the argumentative, “logic-chopping,” and “paradox-mongering” nature of academic philosophy that explains the underrepresentation of women in the discipline, (...) our research questions are the following: Do men and women philosophers make different types of arguments in their published works? If so, which ones and with what frequency? Using data mining and text analysis methods, we study a large corpus of philosophical texts mined from the JSTOR database in order to answer these questions empirically. Using indicator words to classify arguments by type, we search through our corpus to find patterns of argumentation. Overall, the results of our empirical study suggest that women philosophers make deductive, inductive, and abductive arguments in their published works just as much as male philosophers do, with no statistically significant differences in the proportions of those arguments relative to each philosopher’s body of work. (shrink)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially (...) using a third-order accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

The position of Polish informatics, as well in research as in didactic, has its roots in achievements of Polish mathematicians of Warsaw School and logicians of Lvov-Warsaw School. Jan Lukasiewicz is considered in the world of computer science as the most famous Polish logician. The parenthesis-free notation, invented by him, is known as PN (Polish Notation) and RPN (Reverse Polish Notation). Lukasiewicz created many-valued logic as a separate subject. The idea of multi-valueness is applied to hardware design (many-valued or fuzzy (...) switching, analog computer). Many-valued approach to vague notions and commonsense reasoning is the method of expert systems, databases and knowledge-based systems. Stanis3aw Jaokowski's system of natural deduction is the base of systems of automatic deduction and theorem proving. He created a system of paraconsistent logic. Such logics are used in AI. Kazimierz Ajdukiewicz with his categorial grammar participated in the development of formal grammars, the field significant for programming languages. Andrzej Grzegorczyk had an important contribution to the development of the theory of recursiveness. (shrink)

Cross-sectional studies indicate that normal aging is accompanied by decreases in brain structure. Longitudinal studies, however, are relatively rare and inconsistent regarding their outcomes. Particularly the heterogeneity of methods, sample characteristics and the high inter-individual variability in older adults prevent the deduction of general trends. Therefore, the current study aimed to compare longitudinal age-related changes in brain structure in two large independent samples of healthy older adults ; the Longitudinal Healthy Aging Brain database project at the University of Zurich, Switzerland, (...) and 1000BRAINS at the Research Center Juelich, Germany. Annual percentage changes in the two samples revealed stable to slight decreases in cortical thickness over time. After correction for major covariates, i.e., baseline age, sex, education, and image quality, sample differences were only marginally present. Results suggest that general trends across time might be generalizable over independent samples, assuming the same methodology is used, and similar sample characteristics are present. (shrink)

Different researchers use "the philosophy of automated theorem p r o v i n g " t o cover d i f f e r e n t concepts, indeed, different levels of concepts. Some w o u l d count such issues as h o w to e f f i c i e n t l y i n d e x databases as part of the philosophy of automated theorem p r o v i n g (...) . Others wonder about whether f o r m u l a s should be represented as strings or as trees or as lists, and call this part of the philosophy of automated theorem p r o v i n g . Yet others concern themselves w i t h what k i n d o f search should b e embodied i n a n y automated theorem prover, or to what degree any automated theorem prover should resemble Prolog. Still others debate whether natural deduction or semantic tableaux or resolution is " b e t t e r " , a n d c a l l t h i s a part of the p h i l o s o p h y of automated theorem p r o v i n g . Some people wonder whether automated theorem p r o v i n g should be " h u m a n oriented" or "machine o r i e n t e d " — sometimes arguing about whether the internal p r o o f methods should be " h u m a n - I i k e " or not, sometimes arguing about whether the generated proof should be output in a f o r m u n d e r s t a n d a b l e by p e o p l e , and sometimes a r g u i n g a b o u t the d e s i r a b i l i t y o f h u m a n intervention in the process of constructing a proof. There are also those w h o ask such questions as whether we s h o u l d even be concerned w i t h completeness or w i t h soundness of a system, or perhaps we should instead look at very efficient (but i n c o m p l e t e ) subsystems or look at methods of generating models w h i c h might nevertheless validate invalid arguments. A n d a l l of these have been v i e w e d as issues in the philosophy of automated theorem proving. Here, I w o u l d l i k e to step back from such i m p l e m e n t - ation issues and ask: " W h a t do we really think we are doing when we w r i t e an automated theorem prover?" My reflections are perhaps idiosyncratic, but I do think that they put the different researchers* efforts into a broader perspective, and give us some k i n d of handle on w h i c h directions we ourselves m i g h t w i s h to pursue when constructing (or extending) an automated theorem proving system. A logic is defined to be (i) a vocabulary and formation rules ( w h i c h tells us w h a t strings of symbols are w e l l - formed formulas in the logic), and ( i i ) a definition of ' p r o o f in that system ( w h i c h tells us the conditions under which an arrangement of formulas in the system constitutes a proof). Historically speaking, definitions of ' p r o o f have been given in various different manners: the most c o m m o n have been H i l b e r t - s t y l e ( a x i o m a t i c ) , Gentzen-style (consecution, or sequent), F i t c h - s t y l e (natural deduction), and Beth-style (tableaux).. (shrink)

These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International Conference on Rules and Objects in Databases (...) (DOOD 2000) { 10th International Workshop on Logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th International Conference on Inductive Logic Programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { Logic Programming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { Logic Programming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream. (shrink)

Based on the premise that what is relevant, consistent, or true may change from context to context, a formal framework of relevance and context is proposed in which • contexts are mathematical entities • each context has its own language with relevant implication • the languages of distinct contexts are connected by embeddings • inter-context deduction is supported by bridge rules • databases are sets of formulae tagged with deductive histories and the contexts they belong to • abduction (...) and revision are supported by a notion of consistency of formulae and sets of formulae which are relative to a context, and which can, in turn, be seen as constituents of agendas. (shrink)

Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. (...) But the 4-valued logic is deductive in nature, and its matrix is discrete: there are just four values. In this paper I investigate embedding the 4-valued logic into a context of probability. Jøsang's Subjective Logic introduced uncertainty to allow for degrees of belief, disbelief, and uncertainty. We extend this so as to allow for two kinds of uncertainty— that in which the reasoner has too little information (ignorance) and that in which the reasoner has too much information (conflicted). Jøsang's "Opinion Triangle" becomes an "Opinion Tetrahedron" and the 4-values can be seen as its vertices. I make/prove various observations concerning the relation of non-classical "probability" to non-classical logic. (shrink)

In the last decade the concept of context has been extensivelyexploited in many research areas, e.g., distributed artificialintelligence, multi agent systems, distributed databases, informationintegration, cognitive science, and epistemology. Three alternative approaches to the formalization of the notion ofcontext have been proposed: Giunchiglia and Serafini's Multi LanguageSystems (ML systems), McCarthy's modal logics of contexts, andGabbay's Labelled Deductive Systems.Previous papers have argued in favor of ML systems with respect to theother approaches. Our aim in this paper is to support these (...) arguments froma theoretical perspective. We provide a very general definition of ML systems, which covers allthe ML systems used in the literature, and we develop a proof theoryfor an important subclass of them: the MR systems. We prove variousimportant results; among other things, we prove a normal form theorem,the sub-formula property, and the decidability of an importantinstance of the class of the MR systems. The paper concludes with a detailed comparison among the alternativeapproaches. (shrink)

Deductive Cogency holds that the set of propositions towards which one has, or is prepared to have, a given type of propositional attitude should be consistent and closed under logical consequence. While there are many propositional attitudes that are not subject to this requirement, e.g. hoping and imagining, it is at least prima facie plausible that Deductive Cogency applies to the doxastic attitude involved in propositional knowledge, viz. belief. However, this thought is undermined by the well-known preface paradox, (...) leading a number of philosophers to conclude that Deductive Cogency has at best a very limited role to play in our epistemic lives. I argue here that Deductive Cogency is still an important epistemic requirement, albeit not as a requirement on belief. Instead, building on a distinction between belief and acceptance introduced by Jonathan Cohen and recent developments in the epistemology of understanding, I propose that Deductive Cogency applies to the attitude of treating propositions as given in the context of attempting to understand a given phenomenon. I then argue that this simultaneously accounts for the plausibility of the considerations in favor of Deductive Cogency and avoids the problematic consequences of the preface paradox. (shrink)

Recent discussions of genomics and international justice have adopted the concept of ‘global public goods’ to support both the view of genomics as a benefit and the sharing of genomics knowledge across nations. Such discussion relies on a particular interpretation of the global public goods argument, facilitated by the ambiguity of the concept itself. Our aim in this article is to demonstrate this by a close examination of the concept of global public goods with particular reference to its use in (...) the context of genomic databases. We contend that the argument for construing genomics as a global public good depends on seeing it as a natural good by focusing on features intrinsic to genomics knowledge. We shall argue that social and political arrangements are relevant and that recognising this opens the door to construing the use of global public goods language as a strategic one. (shrink)

The distinction between the syntactic and the semantic approach to scientific theories emerged in formal philosophy of science. The semantic approach is commonly considered more advanced and more successful than the syntactic one, but the transition from the one approach to the other was not brought about without any loss. In essence, it is the formal analysis of atomic propositions and the analysis of deductive reasoning that dropped out of consideration in at least some of the elaborated versions of (...) the semantic approach. In structuralist theory of science, as founded by Sneed and Stegmüller, the focus is on global propositions concerning the question of whether or not certain empirical systems satisfy a set-theoretic predicate that encodes the axioms of a scientific theory. Hence, an analysis of deductive reasoning from atomic premisses with the help of a given theory is missing. The objective of the present paper is to develop a deductive system on the basis of the structuralist framework. This system comes with a novel formulation of empirical propositions in structuralism. (shrink)

In this study on deduction, the authors argue that people reason by imagining the relevant state of affairs, ie building an internal model of it, formulating a tentative conclusion based on this model and then searching for alternative models.

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division (...) of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

Initiatives relying on artificial intelligence (AI) to deliver socially beneficial outcomes—AI for social good (AI4SG)—are on the rise. However, existing attempts to understand and foster AI4SG initiatives have so far been limited by the lack of normative analyses and a shortage of empirical evidence. In this Perspective, we address these limitations by providing a definition of AI4SG and by advocating the use of the United Nations’ Sustainable Development Goals (SDGs) as a benchmark for tracing the scope and spread of AI4SG. (...) We introduce a database of AI4SG projects gathered using this benchmark, and discuss several key insights, including the extent to which different SDGs are being addressed. This analysis makes possible the identification of pressing problems that, if left unaddressed, risk hampering the effectiveness of AI4SG initiatives. (shrink)

It has been the dominant view that probabilistic explanations of particular facts must be inductive in character. I argue here that this view is mistaken, and that the aim of probabilistic explanation is not to demonstrate that the explanandum fact was nomically expectable, but to give an account of the chance mechanism(s) responsible for it. To this end, a deductive-nomological model of probabilistic explanation is developed and defended. Such a model has application only when the probabilities occurring in covering (...) laws can be interpreted as measures of objective chance, expressing the strength of physical propensities. Unlike inductive models of probabilistic explanation, this deductive model stands in no need of troublesome requirements of maximal specificity or epistemic relativization. (shrink)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions of (...) the connectives in question. (shrink)

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.