consequence operators
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 1)

H-INDEX

5
(FIVE YEARS 0)

Studia Humana ◽  
2020 ◽  
Vol 9 (3-4) ◽  
pp. 177-193
Author(s):  
Wojciech Krysztofiak

AbstractIn the paper, there is presented the theory of logical consequence operators indexed with taboo functions. It describes the mechanisms of logical inference in the environment of forbidden sentences. This kind of processes take place in ideological discourses within which their participants create various narrative worlds (mental worlds). A peculiar feature of ideological discourses is their association with taboo structures of deduction which penalize speech acts. The development of discourse involves, among others, transforming its deduction structure towards the proliferation of consequence operators and modifying penalty functions. The presented theory enables to define various processes of these transformations in the precise way. It may be used in analyses of conflicts between competing elm experts acting within a discourse.


2007 ◽  
Vol 7 (3) ◽  
pp. 301-353 ◽  
Author(s):  
NIKOLAY PELOV ◽  
MARC DENECKER ◽  
MAURICE BRUYNOOGHE

AbstractIn this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate programs. The semantics is based on the concept of a three-valuedimmediate consequence operatorof an aggregate program. Such an operatorapproximatesthe standard two-valued immediate consequence operator of the program, and induces a unique Kripke-Kleene model, a unique well-founded model and a collection of stable models. We study different ways of defining such operators and thus obtain a framework of semantics, offering different trade-offs betweenprecisionandtractability. In particular, we investigate conditions on the operator that guarantee that the computation of the three types of semantics remains on the same level as for logic programs without aggregates. Other results show that, in practice, even efficient three-valued immediate consequence operators which are very low in the precision hierarchy, still provide optimal precision.


2007 ◽  
Vol 1 (1) ◽  
pp. 139-165 ◽  
Author(s):  
Jürg Kohlas ◽  
Robert F. Stärk

Author(s):  
Robert A. Herrmann

This corrects the major theorem on product consequence operators.


Sign in / Sign up

Export Citation Format

Share Document