A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper we address the question of whether CP are succinctly incomparable with propositional formulas (PF). ...
Canonical (logic) programs (CP) refer to normal logic programs augmented with connective not not. ...
Acknowledgement We are grateful to the anonymous reviewers for their valuable comments. Thanks to Shiguang Feng, Yan Zhang, Jiankun He, Guangrui Dang and Xiaolong Liang for their helpful discussions. ...
arXiv:1412.0320v2
fatcat:eumk2x6imzg2pmy4hwskfav26a
Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks
2015
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also compare ADFs' expressiveness with that of (the two-valued semantics of) abstract argumentation frameworks, normal logic programs and propositional logic. ...
By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional vocabulary A using only atoms from A. ...
Recently, Shen and Zhao (2014) showed that canonical logic programs and propositional logic programs are succinctly incomparable (under an assumption 11 ), and also provide interesting avenues for further ...
doi:10.1613/jair.4879
fatcat:t2qybtcet5eo7kv5s4yj5vvepy
A simple polynomial groundness analysis for logic programs
2000
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The domain of positive Boolean functions, Pos, is by now well established for the analysis of the variable dependencies that arise within logic programs. ...
This paper considers groundness analysis based on a simple subdomain of Pos and compares its precision with that of Pos. Ó ...
Acknowledgements We would like to thank Florence Benoy, Pat Hill and Cohavit Taboch for discussions, Peter Schachte for help with the ROBDD comparison and Roberto Bagnara and the other reviewers of this ...
doi:10.1016/s0743-1066(00)00006-6
fatcat:ytvodjnzarf2ja3vdfhdshkwzy
Institutional 2-cells and Grothendieck Institutions
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Define an institution comorphism going from partial first-order logic with equality to first-order logic with equality as follows: A partial firstorder signature is translated to a total one by encoding ...
Similarly, there are obvious inclusion comorphisms from Casl to ModalCasl and CoCasl, see [15]. Example 11. ...
Acknowledgments There are a number of colleagues who have introduced me into the field and who always are open for interesting discussions and collaborations; here I shall name only Joseph Goguen, Rȃzvan ...
doi:10.1007/11780274_7
fatcat:fefckgydcnbm5mbzp7dcglmwvy
Arbitrary arrow update logic
2017
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The logic AAUL takes arrow update logic, a dynamic epistemic logic where the accessibility relations of agents are updated rather than the set of possible worlds, and adds a quantifier over such arrow ...
We investigate the relative expressivity of AAUL compared to other logics, most notably arbitrary public announcement logic (APAL). ...
We show that, under the usual assumptions that the set of agents is finite and the set of propositional variables is infinite, arbitrary public announcement logic and arbitrary arrow update logic are incomparable ...
doi:10.1016/j.artint.2016.10.003
fatcat:cgethsooajcb5bw3gnftunv2gy
A theory of sampling for continuous-time metric temporal logic
2010
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The relationship between the satisfiability of Metric Temporal Logic (MTL) formulas over continuous-time models and over discrete-time models is studied. ...
This paper revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. ...
In this paper only propositional temporal logics are considered; correspondingly, the elementary building block of temporal logic formulas is defined. Definition 4 Propositional formulas. ...
doi:10.1145/1838552.1838560
fatcat:rnnut4qu3vbnjnxed42fn3lzwa
Adding For-Loops to First-Order Logic
2001
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the case of FO(FOR), there are two kinds of nesting of the FOR operator: in body formulas, and in head formulas. ...
C 2001 Academic Press 157 the extension of first-order logic with the least fixpoint operator; we denote this logic here by FO(LFP). ...
FO(FOR) and FO(PFP) are incomparable if PTIME = PSPACE and FO(FOR) lies strictly between inflationary fixpoint-logic with modular counting and partial fixpoint-logic with (proper) counting. ...
doi:10.1006/inco.2000.2961
fatcat:45ubt7akdrcmzm35ftbj35kp2e
Adding For-Loops to First-Order Logic
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the case of FO(FOR), there are two kinds of nesting of the FOR operator: in body formulas, and in head formulas. ...
C 2001 Academic Press 157 the extension of first-order logic with the least fixpoint operator; we denote this logic here by FO(LFP). ...
FO(FOR) and FO(PFP) are incomparable if PTIME = PSPACE and FO(FOR) lies strictly between inflationary fixpoint-logic with modular counting and partial fixpoint-logic with (proper) counting. ...
doi:10.1007/3-540-49257-7_5
fatcat:7ybp5osji5bkdfwk7bcjiyiu5i
Integrity Constraints for Linked Data
2011
International Workshop on Description Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We prove that datasets with integrity constraints form a symmetric monoidal category, from which the soundness of acyclic dependency graphs follows. ...
For example there is no initial extension of ∅ by: Bool True False True False Bool Bool(x) since there are two incomparable extensions, one with True(x) and one with False(x). ...
[13] use a similar notion of constraint satisfaction, although they consider all minimal J , rather than a canonical J , with respect to subset order on Herbrand models of Skolemized formulae. ...
dblp:conf/dlog/JeffreyP11
fatcat:ewwerpcyd5hdtfilafhonndeje
Monitoring Hyperproperties
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
They are not expressible in standard temporal logics, like LTL, CTL, and CTL*, and thus cannot be monitored with standard runtime verification techniques. ...
HyperLTL extends linear-time temporal logic (LTL) with explicit quantification over traces in order to express Hyperproperties. ...
We distinguish two types of traces, author traces and program committee member traces, where the latter starts with proposition pc. ...
doi:10.1007/978-3-319-67531-2_12
fatcat:3m62rkomlbfkflbmidg54lhnjq
Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
2015
Synthese
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players -they are games of simultaneous moves. ...
also show that the concurrency in partial-order Boolean games can be modelled using a closure-operator semantics, and conclude by considering the relationship of our model to Independence-Friendly (IF) logic ...
Logic IF logic is inherently a two-player logic-the (partial-order) games induced by IF logic formulae are played by two players, ∃ and ∀. ...
doi:10.1007/s11229-015-0991-y
fatcat:gmf6o6qe2rgmzhhn7aes4dgvuu
Proof-Theoretic and Higher-Order Extensions of Logic Programming
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We argue that the emphasis has now moved to the theory and practice of logical frameworks, carrying with it a better understanding of the foundations of proof search. ...
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstraction mechanisms such ...
This survey owes to many of Miller's papers, especially "An Overview of Linear Logic Programming" [50] . ...
doi:10.1007/978-3-642-14309-0_12
fatcat:qj4tb5daj5a75npxcpagh6mltm
To Be Announced
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this survey we review dynamic epistemic logics with modalities for quantification over information change. ...
Of such logics we present complete axiomatizations, focussing on axioms involving the interaction between knowledge and such quantifiers, we report on their relative expressivity, on decidability and on ...
Acknowledgements This investigation is a follow-up of a prior survey of logics with quantifiers over information change, entitled 'Quantifying Notes' [136] , that also focused on open problems. ...
arXiv:2004.05802v3
fatcat:ggf5s443ejh43kh53hpxoiodfi
Linear logic by levels and bounded time complexity
2010
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. ...
A consequence of the higher flexibility of levels with respect to depth is the absence of boxes for handling the paragraph modality. ...
Fig. 14 . 14 An mL 3 proof-net corresponding to t 101 .
2-sequents can be succinctly represented as standard sequents by decorating formulas with an integer index: A i 1 1 , . . . , A i n n represents ...
doi:10.1016/j.tcs.2009.09.015
fatcat:akqggxe2anftpdtpivqksac46i
Querying Visible and Invisible Information
2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also have integrity constraints (invariants given by logical sentences) which may relate the visible relations to the invisible ones. ...
We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible -that is, their complete contents are known -while the remaining relations are invisible. ...
Every CQ Q is associated with a canonical database CanonDB(Q), whose domain consists of variables and constants of Q and whose facts are the atoms of Q. ...
doi:10.1145/2933575.2935306
dblp:conf/lics/BenediktBCP16
fatcat:qlv32v7ftrfxfhvd6xfyjzhvqe
« Previous
Showing results 1 — 15 out of 245 results