相关论文: General Logic-Systems and Consequence Operators

The recent success of Bayesian methods in neuroscience and artificial intelligence gives rise to the hypothesis that the brain is a Bayesian machine. Since logic and learning are both practices of the human brain, it leads to another…

Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…

{log} (read 'setlog') was born as a Constraint Logic Programming (CLP) language where sets and binary relations are first-class citizens, thus fostering set programming. Internally, {log} is a constraint satisfiability solver implementing…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relation, and which form should it take? In this paper, we pose…

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear for query evaluation but suffers from infinite loops…

Recent research in extensions of Answer Set Programming has included a renewed interest in the language of Epistemic Specifications, which adds modal operators K ("known") and M ("may be true") to provide for more powerful introspective…

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.

This paper shows how techniques for linear dynamical systems can be used to reason about the behavior of general loops. We present two main results. First, we show that every loop that can be expressed as a transition formula in linear…

The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…