Results for 'prioritized circumscription, circumscriptive theorem provers, guess and check programs, answer set programming, ASP solvers, general disjunctive programs'

1000+ found
Order:
  1.  23
    生成と検査の論理プログラムの統合による極小限定・定理証明器の構築.富田 一夫 若木 利子 - 2007 - Transactions of the Japanese Society for Artificial Intelligence 22 (5):472-481.
    Recently we proposed a method of compiling prioritized circumscription into answer set programming. However, its encoding has the guess and check structure, where the candidates are generated by the guess program and the check is expressed by the inconsistency of the check program. In this paper, we present another method which compiles prioritized circumscription into a single general disjunctive program by means of integration of the guess and check (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  52
    Modelling ethical rules of lying with answer set programming.Jean-Gabriel Ganascia - 2007 - Ethics and Information Technology 9 (1):39-47.
    There has been considerable discussion in the past about the assumptions and basis of different ethical rules. For instance, it is commonplace to say that ethical rules are defaults rules, which means that they tolerate exceptions. Some authors argue that morality can only be grounded in particular cases while others defend the existence of general principles related to ethical rules. Our purpose here is not to justify either position, but to try to model general ethical rules with artificial (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  14
    Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
    As is well known, answer-set programs do not satisfy the replacement property in general, i.e., programs and that are equivalent may cease to be so when they are put in the context of some other program, i.e., and may have different answer sets. Lifschitz, Pearce, and Valverde thus introduced strong equivalence for context-independent equivalence, and proved that such equivalence holds between given programs and iff and are equivalent theories in the monotonic logic of here-and-there. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  29
    Disjunctive logic programs, answer sets, and the cut rule.Éric Martin - 2022 - Archive for Mathematical Logic 61 (7):903-937.
    In Minker and Rajasekar (J Log Program 9(1):45–74, 1990), Minker proposed a semantics for negation-free disjunctive logic programs that offers a natural generalisation of the fixed point semantics for definite logic programs. We show that this semantics can be further generalised for disjunctive logic programs with classical negation, in a constructive modal-theoretic framework where rules are built from _claims_ and _hypotheses_, namely, formulas of the form \(\Box \varphi \) and \(\Diamond \Box \varphi \) where \(\varphi (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  9
    Assumption-based argumentation for extended disjunctive logic programming and its relation to nonmonotonic reasoning.Toshiko Wakaki - forthcoming - Argument and Computation:1-45.
    The motivation of this study is that Reiter’s default theory as well as assumption-based argumentation frameworks corresponding to default theories have difficulties in handling disjunctive information, while a disjunctive default theory (ddt) avoids them. This paper presents the semantic correspondence between generalized assumption-based argumentation (ABA) and extended disjunctive logic programming as well as the correspondence between ABA and nonmonotonic reasoning approaches such as disjunctive default logic and prioritized circumscription. To overcome the above-mentioned difficulties of ABA (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  54
    Answer-set programming encodings for argumentation frameworks.Uwe Egly, Sarah Alice Gaggl & Stefan Woltran - 2010 - Argument and Computation 1 (2):147-177.
    Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  7.  33
    Theorem Proving in Lean.Jeremy Avigad, Leonardo de Moura & Soonho Kong - unknown
    Formal verification involves the use of logical and computational methods to establish claims that are expressed in precise mathematical terms. These can include ordinary mathematical theorems, as well as claims that pieces of hardware or software, network protocols, and mechanical and hybrid systems meet their specifications. In practice, there is not a sharp distinction between verifying a piece of mathematics and verifying the correctness of a system: formal verification requires describing hardware and software systems in mathematical terms, at which point (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. What is answer set programming?Vladimir Lifschitz - unknown
    Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  9.  14
    Hybrid Answer Set Programming.Alex Brik & Jeffrey Remmel - 2014 - Annals of Pure and Applied Logic 165 (1):134-163.
    This paper discusses an extension of Answer Set Programming called Hybrid Answer Set Programming which allows the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  9
    The complexity and generality of learning answer set programs.Mark Law, Alessandra Russo & Krysia Broda - 2018 - Artificial Intelligence 259:110-146.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  31
    A reductive semantics for counting and choice in answer set programming.Vladimir Lifschitz - unknown
    In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the mean- ing of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  41
    On the relation between SPARQL1.1 and Answer Set Programming.Axel Polleres & Johannes Peter Wallner - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):159-212.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  30
    A First Order Nonmonotonic Extension of Constructive Logic.David Pearce & Agustín Valverde - 2005 - Studia Logica 80 (2):321-346.
    Certain extensions of Nelson's constructive logic N with strong negation have recently become important in arti.cial intelligence and nonmonotonic reasoning, since they yield a logical foundation for answer set programming (ASP). In this paper we look at some extensions of Nelson's .rst-order logic as a basis for de.ning nonmonotonic inference relations that underlie the answer set programming semantics. The extensions we consider are those based on 2-element, here-and-there Kripke frames. In particular, we prove completeness for .rst-order here-and-there logics, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14. Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.
    Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15.  15
    Definitions in Answer Set Programming.Vladimir Lifschitz - unknown
    affects the collection of answer sets. In particular, it is useful to be able to describe the effects of adding definitions to a program with nested expressions, in view of the relation of this class of programs to the input language of the answer set programming system sMonELs. In this..
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  16.  46
    On the practical value of Herbrand disjunctions.Uwe Petermann - 2000 - Logic and Logical Philosophy 8:153.
    Herbrand disjunctions are a means for reducing the problem ofwhether a first-oder formula is valid in an open theory T or not to theproblem whether an open formula, one of the so called Herbrand disjunctions,is T -valid or not. Nevertheless, the set of Herbrand disjunctions, which hasto be examined, is undecidable in general. Fore this reason the practicalvalue of Herbrand disjunctions has been estimated negatively .Relying on completeness proofs which are based on the algebraizationtechnique presented in [30], but taking (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  21
    Answer Sets and Qualitative Decision Making.Gerhard Brewka - 2005 - Synthese 146 (1-2):171-187.
    Logic programs under answer set semantics have become popular as a knowledge representation formalism in Artificial Intelligence. In this paper we investigate the possibility of using answer sets for qualitative decision making. Our approach is based on an extension of the formalism, called logic programs with ordered disjunction (LPODs). These programs contain a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  16
    Answer Sets and Qualitative Optimization.Gerhard Brewka - 2006 - Logic Journal of the IGPL 14 (3):413-433.
    One of the major reasons for the success of answer set programming in recent years was the shift from a theorem proving to a constraint programming view: problems are represented such that stable models, respectively answer sets, rather than theorems correspond to solutions. This shift in perspective proved extremely fruitful in many areas. We believe that going one step further from a “hard” to a “soft” constraint programming paradigm, or, in other words, to a paradigm of qualitative (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  23
    Foundations of a theorem prover for functional and mathematical uses.Javier Leach & Susana Nieva - 1993 - Journal of Applied Non-Classical Logics 3 (1):7-38.
    ABSTRACT A computational logic, PLPR (Predicate Logic using Polymorphism and Recursion) is presented. Actually this logic is the object language of an automated deduction system designed as a tool for proving mathematical theorems as well as specify and verify properties of functional programs. A useful denotationl semantics and two general deduction methods for PLPR are defined. The first one is a tableau algorithm proved to be complete and also used as a guideline for building complete calculi. The second (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  49
    Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
    Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  73
    Safe formulas in the general theory of stable models (preliminary report).Vladimir Lifschitz - unknown
    Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  16
    RASP and ASP as a fragment of linear logic.Stefania Costantini & Andrea Formisano - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):49-74.
    RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on the consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In doing so, we introduce a linear logic representation of default negation as understood in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  7
    Pruning external minimality checking for answer set programs using semantic dependencies.Thomas Eiter & Tobias Kaminski - 2021 - Artificial Intelligence 290 (C):103402.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  18
    Formalization of Context-Free Language Theory.Marcus Vinícius Midena Ramos - 2019 - Bulletin of Symbolic Logic 25 (2):214-214.
    Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different such tools are being increasingly used in order to accelerate and simplify proof checking, and the Coq proof assistant is one of the most well known and used in large-scale projects. Language and automata theory is a well-established area of mathematics, relevant to computer science foundations and information technology. In particular, context-free language (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Twenty-five basic theorems in situation and world theory.Edward N. Zalta - 1993 - Journal of Philosophical Logic 22 (4):385-428.
    The foregoing set of theorems forms an effective foundation for the theory of situations and worlds. All twenty-five theorems seem to be basic, reasonable principles that structure the domains of properties, relations, states of affairs, situations, and worlds in true and philosophically interesting ways. They resolve 15 of the 19 choice points defined in Barwise (1989) (see Notes 22, 27, 31, 32, 35, 36, 39, 43, and 45). Moreover, important axioms and principles stipulated by situation theorists are derived (see Notes (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   55 citations  
  26.  18
    Semantics and complexity of recursive aggregates in answer set programming.Wolfgang Faber, Gerald Pfeifer & Nicola Leone - 2011 - Artificial Intelligence 175 (1):278-298.
  27.  12
    Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.
  28.  20
    Design and results of the Fifth Answer Set Programming Competition.Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca - 2016 - Artificial Intelligence 231 (C):151-181.
  29.  17
    A general theory of confluent rewriting systems for logic programming and its applications.Jürgen Dix, Mauricio Osorio & Claudia Zepeda - 2001 - Annals of Pure and Applied Logic 108 (1-3):153-188.
    Recently, Brass and Dix showed 143–165) that the well founded semantics WFS can be defined as a confluent calculus of transformation rules. This led not only to a simple extension to disjunctive programs 167–213), but also to a new computation of the well-founded semantics which is linear for a broad class of programs. We take this approach as a starting point and generalize it considerably by developing a general theory of Confluent LP-systems CS . Such a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  16
    A general framework for preferences in answer set programming.Gerhard Brewka, James Delgrande, Javier Romero & Torsten Schaub - 2023 - Artificial Intelligence 325 (C):104023.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. Plato’s Metaphysical Development before Middle Period Dialogues.Mohammad Bagher Ghomi - manuscript
    Regarding the relation of Plato’s early and middle period dialogues, scholars have been divided to two opposing groups: unitarists and developmentalists. While developmentalists try to prove that there are some noticeable and even fundamental differences between Plato’s early and middle period dialogues, the unitarists assert that there is no essential difference in there. The main goal of this article is to suggest that some of Plato’s ontological as well as epistemological principles change, both radically and fundamentally, between the early and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  32. Answer Set Programming on Expert Feedback to Populate and Extend.Colin Allen - 2008 - In David Wilson & H. Chad Lane (eds.), Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference. AAAI Press. pp. 500-505.
    dynamic ontologies must be inferred and populated in part from the reference corpora themselves, but ontological rela-.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  12
    Answers set programs for non-transferable utility games: Expressiveness, complexity and applications.Giovanni Amendola, Gianluigi Greco & Pierfrancesco Veltri - 2022 - Artificial Intelligence 302 (C):103606.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  16
    A parametric, resource-bounded generalization of löb’s theorem, and a robust cooperation criterion for open-source game theory.Andrew Critch - 2019 - Journal of Symbolic Logic 84 (4):1368-1381.
    This article presents two theorems: a generalization of Löb’s Theorem that applies to formal proof systems operating with bounded computational resources, such as formal verification software or theorem provers, and a theorem on the robust cooperation of agents that employ proofs about one another’s source code as unexploitable criteria for cooperation. The latter illustrates a capacity for outperforming classical Nash equilibria and correlated equilibria, attaining mutually cooperative program equilibrium in the Prisoner’s Dilemma while remaining unexploitable, i.e., sometimes (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35.  14
    Enhanced Oil Recovery for ASP Flooding Based on Biorthogonal Spatial-Temporal Wiener Modeling and Iterative Dynamic Programming.Shurong Li, Yulei Ge & Yuhuan Shi - 2018 - Complexity 2018:1-19.
    Because of the mechanism complexity, coupling, and time-space characteristic of alkali-surfactant-polymer flooding, common methods are very hard to be implemented directly. In this paper, an iterative dynamic programming based on a biorthogonal spatial-temporal Wiener modeling method is developed to solve the enhanced oil recovery for ASP flooding. At first, a comprehensive mechanism model for the enhanced oil recovery of ASP flooding is introduced. Then the biorthogonal spatial-temporal Wiener model is presented to build the relation between inputs and states, in which (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  16
    Safe beliefs for propositional theories.Mauricio Osorio, Juan Antonio Navarro Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
    We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more general point of view. Our definition, based on intuitionistic logic and following ideas from D. Pearce [Stable inference as intuitionistic validity, Logic Programming 38 79–91], also provides a general approach to define several semantics based on different logics or inference systems. We prove that, in particular, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  3
    Safe beliefs for propositional theories.Mauricio Osorio, Juan Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
    We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more general point of view. Our definition, based on intuitionistic logic and following ideas from D. Pearce [Stable inference as intuitionistic validity, Logic Programming 38 79–91], also provides a general approach to define several semantics based on different logics or inference systems. We prove that, in particular, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  18
    ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.
  39. Arrow's Theorem.Michael Morreau - 2014 - Stanford Encyclopedia of Philosophy: N/A.
    Kenneth Arrow’s “impossibility” theorem—or “general possibility” theorem, as he called it—answers a very basic question in the theory of collective decision-making. Say there are some alternatives to choose among. They could be policies, public projects, candidates in an election, distributions of income and labour requirements among the members of a society, or just about anything else. There are some people whose preferences will inform this choice, and the question is: which procedures are there for deriving, from what (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  40.  29
    Splittings and Disjunctions in Reverse Mathematics.Sam Sanders - 2020 - Notre Dame Journal of Formal Logic 61 (1):51-74.
    Reverse mathematics is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, that is, non-set-theoretic, mathematics. As suggested by the title, this paper deals with two RM-phenomena, namely, splittings and disjunctions. As to splittings, there are some examples in RM of theorems A, B, C such that A↔, that is, A can be split into (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  14
    Logical metatheorems for accretive and (generalized) monotone set-valued operators.Nicholas Pischke - 2023 - Journal of Mathematical Logic 24 (2).
    Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, we establish logical metatheorems (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  13
    FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
  43.  9
    Relating constraint answer set programming languages and algorithms.Yuliya Lierler - 2014 - Artificial Intelligence 207 (C):1-22.
  44.  36
    Automated legal reasoning with discretion to act using s(LAW).Joaquín Arias, Mar Moreno-Rebato, Jose A. Rodriguez-García & Sascha Ossowski - forthcoming - Artificial Intelligence and Law:1-24.
    Automated legal reasoning and its application in smart contracts and automated decisions are increasingly attracting interest. In this context, ethical and legal concerns make it necessary for automated reasoners to justify in human-understandable terms the advice given. Logic Programming, specially Answer Set Programming, has a rich semantics and has been used to very concisely express complex knowledge. However, modelling discretionality to act and other vague concepts such as ambiguity cannot be expressed in top-down execution models based on Prolog, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  4
    From answer set logic programming to circumscription via logic of GK.Fangzhen Lin & Yi Zhou - 2011 - Artificial Intelligence 175 (1):264-277.
  46.  32
    Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
    The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree below $\emptyset'$ but (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  47.  26
    Representing and Reasoning about Game Strategies.Dongmo Zhang & Michael Thielscher - 2015 - Journal of Philosophical Logic 44 (2):203-236.
    As a contribution to the challenge of building game-playing AI systems, we develop and analyse a formal language for representing and reasoning about strategies. Our logical language builds on the existing general Game Description Language and extends it by a standard modality for linear time along with two dual connectives to express preferences when combining strategies. The semantics of the language is provided by a standard state-transition model. As such, problems that require reasoning about games can be solved by (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  15
    Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
    We consider McCarthy's notions of predicate circumscription and formula circumscription. We show that the decision problems “does θ have a countably infinite minimal model” and “does φ hold in every countably infinite minimal model of θ” are complete Σ 1 2 and complete π 1 2 over the integers, for both forms of circumscription. The set of structures definable as first order definable subsets of countably infinite minimal models is the set of structures which are Δ 1 2 over the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49.  32
    Groups and algebras of binary relations.Steven Givant & Hajnal Andréka - 2002 - Bulletin of Symbolic Logic 8 (1):38-64.
    In 1941, Tarski published an abstract, finitely axiomatized version of the theory of binary relations, called the theory of relation algebras, He asked whether every model of his abstract theory could be represented as a concrete algebra of binary relations. He and Jonsson obtained some initial, positive results for special classes of abstract relation algebras. But Lyndon showed, in 1950, that in general the answer to Tarski's question is negative. Monk proved later that the answer remains negative (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  23
    Language Learnability in the Limit: A Generalization of Gold’s Theorem.Fernando C. Alves - 2023 - Journal of Logic, Language and Information 32 (3):363-372.
    In his pioneering work in the field of inductive inference, Gold (Inf Control 10:447–474, 1967) proved that a set containing all finite languages and at least one infinite language over the same fixed alphabet is not identifiable in the limit (learnable in the exact sense) from complete texts. Gold’s work paved the way for computational learning theories of language and has implications for two linguistically relevant classes in the Chomsky hierarchy (cf. Chomsky in Inf Control 2:137–167, 1959, Chomsky in Knowledge (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000