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
Labelled propositional modal logics: theory and practice
1997
Journal of Logic and Computation
Preserved Fulltext
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, ...
We also investigate the tradeo s in possible labelled presentations: we show that a narrow interface between the base logic and the labelling algebra supports modularity and provides an attractive proof-theory ...
In Section 2 we present a hierarchy of labelled propositional modal logics based on K and Horn relational theories. ...
doi:10.1093/logcom/7.6.685
fatcat:nvldw53eb5awthofgdcmpus2be
Annotated defeasible logic
2017
Theory and Practice 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.
In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism. ...
There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. ...
The annotation mechanism we presented is closely related to the introduction of modal literals in modal defeasible logic (Governatori et al. 2016) , where each rule is labelled with the mode (✷) its conclusion ...
doi:10.1017/s1471068417000266
fatcat:punrmfkirfc5heopfuqbcomz74
Temporalized logics and automata for time granularity
2004
Theory and Practice 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 2017; you can also visit the original URL.
The file type is application/pdf.
Then, we exploit the correspondence between temporalized logics and automata to reduce the task of finding the temporal logic counterparts of the given theories of time granularity to the easier one of ...
In this paper, we provide the monadic second-order theories of downward unbounded layered structures, which are infinitely refinable structures consisting of a coarsest domain and an infinite number of ...
Goranko, Maarten de Rijke, and Wolfgang Thomas for their positive feedback on the work reported in the paper. ...
doi:10.1017/s147106840400208x
fatcat:gum2ttgmybgsjd2virziysrlru
Logics for Legal Dynamics
[chapter]
2015
Logic in the Theory and Practice of Lawmaking
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 build such a logic in steps starting from basic defeasible logic, and we show how to use it to model different forms of modifications such as derogations, textual modifications, abrogation and annulment ...
In this contribution we propose Temporal Defeasible Logic to model legal dynamics. ...
Acknowledgements NICTA is funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program. ...
doi:10.1007/978-3-319-19575-9_12
fatcat:oko3zyfde5dqfkovfo5vzijls4
A spatial similarity measure based on games: theory and practice
2002
Logic Journal of the IGPL
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.
Keywords: model comparison games, similarity measures, modal logics of space, image retrieval based on spatial relationships L. ...
We show how this is possible in the case of the spatial modal logic S4u of Bennett. The approach results in a spatial similarity measure based on topological model comparison games. ...
This work was supported in part by CNR grants 203.15.10 and 203.7.27. ...
doi:10.1093/jigpal/10.1.1
fatcat:ubnlxqwx3zf3bl7doemwsfkvxe
Logic-based specification languages for intelligent software agents
2004
Theory and Practice 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 2020; you can also visit the original URL.
The file type is application/pdf.
For each executable language, the logic foundations are described and an example of use is shown. ...
A comparison of the six languages and a survey of similar approaches complete the paper, together with considerations of the advantages of using logic-based languages in MAS modeling and prototyping. ...
of ALIAS and LAILA. ...
doi:10.1017/s1471068404002029
fatcat:6kmzv4tdmjh6lbw2tjedo6nnbu
Observational equivalences for linear logic concurrent constraint languages
2011
Theory and Practice 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 2011; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of ...
logic. ...
Acknowledgements The research leading to these results has received funding from the Madrid Regional We thank the reviewers for their helpful and constructive comments. ...
doi:10.1017/s1471068411000123
fatcat:fivqxkiwezewtkjjtydkzvd7ne
Logic programming for finding models in the logics of knowledge and its applications: A case study
2010
Theory and Practice of Logic Programming
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1007.3700v1 fatcat:u3p6lwgxdrh5hp3sz4wuyu23li
AbstractThe logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. ...
This paper explores the use of logic programming (LP) to encode interesting forms of logics of knowledge and compute Kripke models. ...
The modal language LK A builds on a signature that contains a collection of propositions F (often referred to as fluents), the traditional propositional connectives, and a finite set of modal operators ...
doi:10.1017/s1471068410000359
fatcat:ykixzz34fbbdtnn7k5gewtejtq
Defeasible logic programming: an argumentative approach
2004
Theory and Practice 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 2017; you can also visit the original URL.
The file type is application/pdf.
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. ...
Thus, the resulting approach is suitable for representing agent's knowledge and for providing an argumentation based reasoning mechanism to agents. ...
helpful comments and suggestions. ...
doi:10.1017/s1471068403001674
fatcat:s6lzewbrn5gf3kbls2zuy4si2u
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
2009
Theory and Practice 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 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs intoquantified propositional logic, an extension of classical propositional ...
Thus, quantified propositional logic is a fragment of second-order logic, and its formulas are usually referred to asquantified Boolean formulas(QBFs). ...
Examples include the following areas: • nonmonotonic formalisms like logic-based abduction, default logic, and modal nonmonotonic logics (Egly et al. 2000; Eiter et al. 2002) ; • consistency-based belief ...
doi:10.1017/s147106840999010x
fatcat:4qwun6nfb5ctdpxdmnnulw5nmu
Linear-Time Temporal Answer Set Programming
2021
Theory and Practice 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 2022; you can also visit the original URL.
The file type is application/pdf.
In the remainder of the paper, we focus on practical aspects, defining a syntactic fragment called (modal) temporal logic programs closer to ASP, and explaining how this has been exploited in the construction ...
In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. ...
We are especially grateful to David Pearce, whose help and collaboration on Equilibrium Logic was the seed for a great part of the current paper. ...
doi:10.1017/s1471068421000557
fatcat:iwqi332tnbdkdiydjq2cn5ci5a
Semantics for Possibilistic Disjunctive Programs
2011
Theory and Practice 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 2018; you can also visit the original URL.
The file type is application/pdf.
By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic ...
It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. ...
Given a set of proposition symbols S and a theory Γ in a logic X. If Γ X S if and only if ∀s ∈ S Γ X s.
Interpretations and models In this section we define some relevant concepts w.r.t. semantics. ...
doi:10.1017/s1471068411000408
fatcat:d6be4dfdxvfgrjmssuyq34uhre
Reasoning about actions with Temporal Answer Sets
2012
Theory and Practice 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 2018; you can also visit the original URL.
The file type is application/pdf.
DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. ...
AbstractIn this paper, we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite ...
DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. ...
doi:10.1017/s1471068411000639
fatcat:lfgobwhjdjfhfghpz5ke7rmfga
selp: A Single-Shot Epistemic Logic Program Solver
2020
Theory and Practice 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 2022; you can also visit the original URL.
The file type is application/pdf.
Epistemic logic programs (ELPs) are an extension of answer set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. ...
Proposition 15 Θ and Θ ↑ are validity-equivalent. ...
optimizations), selp: A Single-Shot Epistemic Logic Program Solver also adhering to the practical considerations presented in Section 3.2, and it finally outputs the resulting non-ground logic program ...
doi:10.1017/s1471068420000022
fatcat:thhtfauywfc3zolp24ybt3k2zy
Transformations of logic programs on infinite lists
2010
Theory and Practice 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 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
systems and, in general, properties of infinite sequences of events. ...
AbstractWe consider an extension of logic programs, called ω-programs, that can be used to define predicates overinfinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive ...
We also thank John Gallagher for his comments and the anonymous referees of ICLP 2010 for their constructive criticism. We also acknowledge the financial support of: ...
doi:10.1017/s1471068410000177
fatcat:kr4g2ym43vcibpn7vv2klmsmpm
« Previous
Showing results 1 — 15 out of 18,615 results