Log in

Relevant bibliographies by topics / Logics and meaning of programs / Journal articles

To see the other types of publications on this topic, follow the link: Logics and meaning of programs.

Journal articles on the topic 'Logics and meaning of programs'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Logics and meaning of programs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Hornischer, Levin. "Logics of Synonymy." Journal of Philosophical Logic 49, no. 4 (January 9, 2020): 767–805. http://dx.doi.org/10.1007/s10992-019-09537-5.

Full text

Abstract:

AbstractWe investigate synonymy in the strong sense of content identity (and not just meaning similarity). This notion is central in the philosophy of language and in applications of logic. We motivate, uniformly axiomatize, and characterize several “benchmark” notions of synonymy in the messy class of all possible notions of synonymy. This class is divided by two intuitive principles that are governed by a no-go result. We use the notion of a scenario to get a logic of synonymy (SF) which is the canonical representative of one division. In the other division, the so-called conceptivist logics, we find, e.g., the well-known system of analytic containment (AC). We axiomatize four logics of synonymy extending AC, relate them semantically and proof-theoretically to SF, and characterize them in terms of weak/strong subject matter preservation and weak/strong logical equivalence. This yields ways out of the no-go result and novel arguments—independent of a particular semantic framework—for each notion of synonymy discussed (using, e.g., Hurford disjunctions or homotopy theory). This points to pluralism about meaning and a certain non-compositionality of truth in logic programs and neural networks. And it unveils an impossibility for synonymy: if it is to preserve subject matter, then either conjunction and disjunction lose an essential property or a very weak absorption law is violated.

APA, Harvard, Vancouver, ISO, and other styles

2

Faber, Wolfgang, Michael Morak, and Stefan Woltran. "Strong Equivalence for Epistemic Logic Programs Made Easy." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2809–16. http://dx.doi.org/10.1609/aaai.v33i01.33012809.

Full text

Abstract:

Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of new research, as well as efficient solvers. An important question is under which conditions a sub-program can be replaced by another one without changing the meaning, in any context. This problem is known as strong equivalence, and is well-studied for ASP. For ELPs, this question has been approached by embedding them into epistemic extensions of equilibrium logics. In this paper, we consider a simpler, more direct characterization that is directly applicable to the language used in state-of-the-art ELP solvers. This also allows us to give tight complexity bounds, showing that strong equivalence for ELPs remains coNP-complete, as for ASP. We further use our results to provide syntactic characterizations for tautological rules and rule subsumption for ELPs.

APA, Harvard, Vancouver, ISO, and other styles

3

HARRISON, AMELIA, and YULIYA LIERLER. "First-order modular logic programs and their conservative extensions." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 755–70. http://dx.doi.org/10.1017/s1471068416000430.

Full text

Abstract:

AbstractModular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. We show how the notion of a conservative extension can be used to justify the common projection rewriting.

APA, Harvard, Vancouver, ISO, and other styles

4

De Giacomo, G., and M. Lenzerini. "A Uniform Framework for Concept Definitions in Description Logics." Journal of Artificial Intelligence Research 6 (March 1, 1997): 87–110. http://dx.doi.org/10.1613/jair.334.

Full text

Abstract:

Most modern formalisms used in Databases and Artificial Intelligence for describing an application domain are based on the notions of class (or concept) and relationship among classes. One interesting feature of such formalisms is the possibility of defining a class, i.e., providing a set of properties that precisely characterize the instances of the class. Many recent articles point out that there are several ways of assigning a meaning to a class definition containing some sort of recursion. In this paper, we argue that, instead of choosing a single style of semantics, we achieve better results by adopting a formalism that allows for different semantics to coexist. We demonstrate the feasibility of our argument, by presenting a knowledge representation formalism, the description logic muALCQ, with the above characteristics. In addition to the constructs for conjunction, disjunction, negation, quantifiers, and qualified number restrictions, muALCQ includes special fixpoint constructs to express (suitably interpreted) recursive definitions. These constructs enable the usual frame-based descriptions to be combined with definitions of recursive data structures such as directed acyclic graphs, lists, streams, etc. We establish several properties of muALCQ, including the decidability and the computational complexity of reasoning, by formulating a correspondence with a particular modal logic of programs called the modal mu-calculus.

APA, Harvard, Vancouver, ISO, and other styles

5

Mabuchi, Hiroshi, Kiyoshi Akama, Hidekatsu Koike, and Katsunori Miura. "Infinite Computation in the Equivalent Transformation Model." Journal of Advanced Computational Intelligence and Intelligent Informatics 11, no. 2 (February 20, 2007): 176–86. http://dx.doi.org/10.20965/jaciii.2007.p0176.

Full text

Abstract:

There are many logic programs that do not terminate but perform useful computation in some sense. The usual theory of logic programming adopts least fixpoints to define the meaning of programs, which fails to capture the intended meaning of infinite computation. To give an appropriate sense to useful infinite computation, the theory of logic programming has adopted greatest fixpoints in place of least fixpoints. However, this solution developed in logic paradigm can not explain finite and infinite computation in a unified manner. This paper proposes a new approach to infinite computation based on the equivalent transformation paradigm, where infinite computation is regarded as repeated equivalent transformations and is given appropriate sense in the same way as the usual finite computation.

APA, Harvard, Vancouver, ISO, and other styles

6

HAYES, IAN, ROBERT COLVIN, DAVID HEMER, PAUL STROOPER, and RAY NICKSON. "A refinement calculus for logic programs." Theory and Practice of Logic Programming 2, no. 4-5 (July 2002): 425–60. http://dx.doi.org/10.1017/s1471068402001448.

Full text

Abstract:

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

APA, Harvard, Vancouver, ISO, and other styles

7

Subrahmanian, V. S. "Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions." Fundamenta Informaticae 13, no. 4 (October 1, 1990): 465–83. http://dx.doi.org/10.3233/fi-1990-13405.

Full text

Abstract:

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

APA, Harvard, Vancouver, ISO, and other styles

8

Hirani, Anil, and V. S. Subrahmanian. "Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs." Fundamenta Informaticae 13, no. 3 (July 1, 1990): 317–32. http://dx.doi.org/10.3233/fi-1990-13306.

Full text

Abstract:

Given a logic program P, the operator TP associated with P is closely related to the intended meaning of P. Given a first order language L that is generated by finitely many non-logical symbols, our aim is to study the algebraic properties of the set {TP|P is a general logic program in language L} with certain operators on it. For the operators defined in this paper the resulting algebraic structure is a bounded distributive lattice. Our study extends (to the case of general logic programs), the work of Mancarella and Pedreschi who initiated a study of the algebraic properties of the space of pure logic programs. We study the algebraic properties of this set and identify the ideals and zero divisors. In addition, we prove that our algebra satisfies various non-extensibility conditions.

APA, Harvard, Vancouver, ISO, and other styles

9

DAGNINO, FRANCESCO, DAVIDE ANCONA, and ELENA ZUCCA. "Flexible coinductive logic programming." Theory and Practice of Logic Programming 20, no. 6 (September 22, 2020): 818–33. http://dx.doi.org/10.1017/s147106842000023x.

Full text

Abstract:

AbstractRecursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to get the correct meaning. We provide a detailed formal account of an extension of logic programming supporting flexible coinduction. Syntactically, programs are enriched by coclauses, clauses with a special meaning used to tune the interpretation of predicates. As usual, the declarative semantics can be expressed as a fixed point which, however, is not necessarily the least, nor the greatest one, but is determined by the coclauses. Correspondingly, the operational semantics is a combination of standard SLD resolution and coSLD resolution. We prove that the operational semantics is sound and complete with respect to declarative semantics restricted to finite comodels.

APA, Harvard, Vancouver, ISO, and other styles

10

Bergadano, F., D. Gunetti, and U. Trinchero. "The Difficulties of Learning Logic Programs with Cut." Journal of Artificial Intelligence Research 1 (November 1, 1993): 91–107. http://dx.doi.org/10.1613/jair.26.

Full text

Abstract:

As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.

APA, Harvard, Vancouver, ISO, and other styles

11

Cozman, Fabio Gagliardi, and Denis Deratani Mauá. "On the Semantics and Complexity of Probabilistic Logic Programs." Journal of Artificial Intelligence Research 60 (September 27, 2017): 221–62. http://dx.doi.org/10.1613/jair.5482.

Full text

Abstract:

We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato's distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the "credal semantics") produces sets of probability measures that dominate infinitely monotone Choquet capacities; we describe several useful consequences of this result. We then examine the complexity of inference with probabilistic logic programs. We distinguish between the complexity of inference when a probabilistic program and a query are given (the inferential complexity), and the complexity of inference when the probabilistic program is fixed and the query is given (the query complexity, akin to data complexity as used in database theory). We obtain results on the inferential and query complexity for acyclic, stratified, and normal propositional and relational programs; complexity reaches various levels of the counting hierarchy and even exponential levels.

APA, Harvard, Vancouver, ISO, and other styles

12

Pierotti, Rachael S., Milli Lake, and Chloé Lewis. "Equality on His Terms: Doing and Undoing Gender through Men’s Discussion Groups." Gender & Society 32, no. 4 (June 21, 2018): 540–62. http://dx.doi.org/10.1177/0891243218779779.

Full text

Abstract:

Efforts to promote gender equality often encourage changes to interpersonal interactions as a way of undermining gender hierarchy. Such programs are premised on the idea that the gender system can be “undone” when individuals behave in ways that challenge prevailing gender norms. However, scholars know little about whether and under what conditions real changes to the gender system can result from changed behaviors. We use the context of a gender sensitization program in the Democratic Republic of Congo to examine prospects for transformative change at the interactional level of the gender system. Over nine months, we observed significant changes in men’s quotidian practices. Further, we identified a new commitment among many men to a more equal division of household labor. However, participants consistently undermined the transformative potential of these behavioral changes through their dedication to maintaining control over the objective, process, and meaning of change, resisting conceptions of equality that challenged the gender system. Because quotidian changes left gender hierarchy intact, they appear unlikely to destabilize the logics that legitimate women’s subordination.

APA, Harvard, Vancouver, ISO, and other styles

13

LOKE, SENG WAI, and ANDREW DAVISON. "Secure Prolog-based mobile code." Theory and Practice of Logic Programming 1, no. 3 (May 2001): 321–57. http://dx.doi.org/10.1017/s1471068401001211.

Full text

Abstract:

LogicWeb mobile code consists of Prolog-like rules embedded in Web pages, thereby adding logic programming behaviour to those pages. Since LogicWeb programs are downloaded from foreign hosts and executed locally, there is a need to protect the client from buggy or malicious code. A security model is crucial for making LogicWeb mobile code safe to execute. This paper presents such a model, which supports programs of varying trust levels by using different resource access policies. The implementation of the model derives from an extended operational semantics for the LogicWeb language, which provides a precise meaning of safety.

APA, Harvard, Vancouver, ISO, and other styles

14

CABALAR, PEDRO. "Functional answer set programming." Theory and Practice of Logic Programming 11, no. 2-3 (February 4, 2011): 203–33. http://dx.doi.org/10.1017/s1471068410000517.

Full text

Abstract:

AbstractIn this paper we propose an extension of Answer Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL=ℱwhere the set of functions is partitioned into Herbrand functions (orconstructors) and evaluable functions (oroperations). We show how this extension has a direct connection to Scott'sLogic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

APA, Harvard, Vancouver, ISO, and other styles

15

NAISH, LEE, and HARALD SØNDERGAARD. "Truth versus information in logic programming." Theory and Practice of Logic Programming 14, no. 6 (June 3, 2013): 803–40. http://dx.doi.org/10.1017/s1471068413000069.

Full text

Abstract:

AbstractThe semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood but also for “undefined”. The three-valued semantics proposed by Fitting (Fitting, M. 1985. A Kripke–Kleene semantics for logic programs. Journal of Logic Programming 2, 4, 295–312) and Kunen (Kunen, K. 1987. Negation in logic programming. Journal of Logic Programming 4, 4, 289–308) are closely related to what is computed by a logic program, the third truth value being associated with non-termination. A different three-valued semantics, proposed by Naish, shared much with those of Fitting and Kunen but incorporated allowances for programmer intent, the third truth value being associated with underspecification. Naish used an (apparently) novel “arrow” operator to relate the intended meaning of left and right sides of predicate definitions. In this paper we suggest that the additional truth values of Fitting/Kunen and Naish are best viewed as duals. We use Belnap's four-valued logic (Belnap, N. D. 1977. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, J. M. Dunn and G. Epstein, Eds. D. Reidel, Dordrecht, Netherlands, 8–37), also used elsewhere by Fitting, to unify the two three-valued approaches. The truth values are arranged in a bilattice, which supports the classical ordering on truth values as well as the “information ordering”. We note that the “arrow” operator of Naish (and our four-valued extension) is essentially the information ordering, whereas the classical arrow denotes the truth ordering. This allows us to shed new light on many aspects of logic programming, including program analysis, type and mode systems, declarative debugging and the relationships between specifications and programs, and successive execution states of a program.

APA, Harvard, Vancouver, ISO, and other styles

16

Tselishchev, Vitaly V. "Intensionality: From Philosophical Logic to Metamathematics." Vestnik Tomskogo gosudarstvennogo universiteta, no. 458 (2020): 85–89. http://dx.doi.org/10.17223/15617793/458/10.

Full text

Abstract:

The article is devoted to the study of the status of intensionality in the exact contexts of logical and mathematical theories. The emergence of intensionality in logical and mathematical discourse leads to significant obstacles in its formalization due to the appearance of indirect contexts, the uncertainty of its indication in the theoretical apparatus, as well as the presence of various kinds of difficult-to-account semantic distinctions. The refusal to consider intensionality in logic is connected with Bertrand Russell’s criticism of Alexius Meinong’s intensionality ontology, and with Willard Van Orman Quine’s criticism of the concept of meaning and quantification of modalities. It is shown that this criticism is based on a preference for the theory of indication over the theory of meaning, in terms of the distinction “Bedeutung” and “Sinn” introduced by Gottlob Frege. The extensionality thesis is explicated; by analogy with it the intensionality thesis is constructed. It is shown that complete parallelism is not possible here, and therefore we should proceed from finding cases of extensionality violation. Since the construction of formal logical systems is to a certain extent connected with the programs of the foundations of mathematics, the complex interweaving of philosophical and purely technical questions makes the question of the role of intensionality in mathematics quite confusing. However, there is one clue here: programs in the foundations of mathematics have given rise to metamathematics, which, although it stands alone, is considered a branch of mathematics. It is not by chance that, judging by the problems arising in connection with intensionality, there is a growing suspicion that intensionality can play a significant role in metamathematics. As for the question of the sense in which metamathematics results can be considered mathematical, in terms of the presence of intensional contexts in both disciplines, it is a matter of taste: for example, the autonomy of mathematical knowledge as a result of the desire of mathematicians to eliminate the influence of philosophy that took place in the case of David Hilbert may be worth considering in the context of mathematics. Thus, the rather vague concept of intensionality receives various explications in different contexts, whether it is philosophical logic or metamathematics. In any case, the detection of context intensionality is always associated with a clear narrowing of the research area. It is obvious that the creation of a more general theory of intensionality is possible within a more general framework, in which logic and mathematics must be combined. In this respect, we can hope for the resumption of a logical project, which would be a purely logical consideration made of the natural and the mathematical.

APA, Harvard, Vancouver, ISO, and other styles

17

Bezerra, Ada Augusta Celestino, and Márcia Alves Carvalho Machado. "Programas de alfabetização para jovens e adultos: PAS e PBA, concepções e gestão." Revista @mbienteeducação 10, no. 2 (October 9, 2017): 236. http://dx.doi.org/10.26843/ae19828632v10n22017p236a250.

Full text

Abstract:

O objetivo desse estudo é configurar os dois principais programas implantados pelo Governo Federal pós LDB/1996 visando à alfabetização de jovens e adultos, o PAS e o PBA, detendo-se de forma particular no PBA, com a análise dos seus objetivos, concepção de educação e aspectos relativos à gestão do programa. Trata-se de pesquisa teórica e de campo, com uso da abordagem qualitativa, cujas fontes de informações foram os documentos legais e orientadores das políticas e aquelas obtidas por meio de entrevista com o gestor nacional do PBA. As conclusões apontam que, embora os objetivos dos programas de alfabetização de adultos no Brasil tenham sido ampliados no sentido de universalizar a educação para as pessoas de 15 anos ou mais, a concepção de educação legitimada por eles, advinda das orientações da UNESCO, segue a lógica neoliberal. Também ficou patente que o Estado atribui um sentido simplista à alfabetização de jovens e adultos indicando como sua principal preocupação implantar políticas educacionais que embora assegurem o direito à educação, não avançam para uma perspectiva efetivamente democrática e emancipatória, perpetuando a característica compensatória das políticas para a EJA. Desse modo, evidencia-se a necessidade de avanço das políticas de Estado mediante programas que de fato contribuam para o fim do analfabetismo, monitorados e avaliados pelo poder público e pela sociedade civil, em especial visando às caraterísticas de descentralização, autonomia e flexibilidade. Palavras-chave: Alfabetização de Jovens e Adultos. Educação. Gestão. PAS. PBA. Abstract:The objective of this study is to configure the two main programs implemented by the Federal Government after LDB/1996, aiming at the literacy of youths and adults, PAS and PBA, with a particular focus on PBA, analyzing its objectives, conception of Education and management aspects of the program. This is a theoretical and field research, using the qualitative approach, whose sources of information were the legal and policy documents and those obtained through an interview with the national manager of the PBA. The conclusions point out that, although the objectives of adult literacy programs in Brazil have been broadened in order to universalize education for people aged 15 years or more, the conception of education legitimized by them, coming from the UNESCO guidelines, follows the neoliberal logic. It also became clear that the State attributes a simplistic meaning to the literacy of youths and adults, indicating that their main concern is to implement educational policies that, while guaranteeing the right to education, do not advance towards an effectively democratic and emancipatory perspective, perpetuating the compensatory characteristic of policies for YAE. In this way, it is evident the need to advance state policies through programs that actually contribute to the end of illiteracy, monitored and evaluated by the government and civil society, especially with the characteristics of decentralization, autonomy and flexibility. Keywords: Youth and Adult Literacy. Education. Management. PAS. PBA.

APA, Harvard, Vancouver, ISO, and other styles

18

Kultaieva, Maria. "Political Implications of Philosophical Pedagogy." Filosofiya osvity. Philosophy of Education 24, no. 1 (December 4, 2019): 32–51. http://dx.doi.org/10.31874/2309-1606-2019-24-1-32-51.

Full text

Abstract:

The article proposes the critical analyses of the P. Mehring conception of philosophical pedagogy founded on the German idealism and Humboldt’s philosophy of education. Transformations of the philosophical pedagogy are considering on the background of organizing changes in the education in the industrial and post-industrial contexts with regard to its meaning, logics and causes. The advantages of the interdisciplinary approach are proving on the problem field of the philosophical pedagogy in times of its rising and falls.The restoration of philosophical pedagogy of the early and developed industrialism is proposing with its idealistic and institutional paradigm (Humboldt-Hegel-Spranger) and the alternative one – the critical anti-institutionalism(Nietzsche -Adorno-Foucault), The heuristic metaphor of the invention of freedom shows on the political engagement of philosophical pedagogy what has both the negative and positive aspects. Some political pathologies of the state in the early post-industrial societies need pedagogical treating. That is why the revival perspective of philosophical pedagogy is inquiring. For this case some actual ideas of W. von Humboldt and its transformations are used to show the risks and dangerous of educational reforms in the post-industrial contexts.The Kantian and Hegelian transformations are researching with the aim to show different tendencies of the development of education in philosophical reflections of pedagogical issues with political consequences regarding as possible paradigmatic changes which can exist as complementary ones. The coherence of political and pedagogical ideas can exist in different constellations pursuing different purposes. The pedagogical construct of freedom as autonomy was often used in the political programs and political decisions, but the political reason is also an important factor for the transformations of contemporary educational systems and practices. The pedagogical construct of freedom foresees the autonomy of educational institutions and independency of individual which cal be lost by his transforming to a Wikipedia-citizen.

APA, Harvard, Vancouver, ISO, and other styles

19

Wasilewska, Anita. "Programs and logics." Studia Logica 44, no. 2 (1985): 125–37. http://dx.doi.org/10.1007/bf00379762.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Buijkx, Michael. "Woordenschatgraven." Lampas 53, no. 3 (October 1, 2020): 360–83. http://dx.doi.org/10.5117/lam2020.3.005.buij.

Full text

Abstract:

Summary Many vocabulary lists in Dutch coursebooks are indirectly based on frequency research, and on the assumption that any particular selection of Latin literature might benefit from a representative list. However, the selection of merely 50 pages of Latin for Dutch senior high school education exams does not hold up to both linguistic and statistical logic. As a practical work-around a dichotomy is suggested between ‘content words’ and ‘structure words’. Whereas the latter (conjunctions, prepositions, pronouns and adverbs with a general meaning) can acceptably be selected on a frequency basis, the selection of the former (nouns, adjectives and verbs) can be tailored to the specific content of a text corpus with the help of the ‘Collatinus’ open source application. Statistical samples are taken from eight recent final examination programs and the criteria for a tailormade selection are illustrated with Cicero’s Pro Roscio (national exams 2021). Various classroom activities and consequences for editing educational resources are presented.

APA, Harvard, Vancouver, ISO, and other styles

21

Baltag, Alexandru, and Lawrence S. Moss. "Logics for Epistemic Programs." Synthese 139, no. 2 (March 2004): 165–224. http://dx.doi.org/10.1023/b:synt.0000024912.56773.5e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Sulistyaningrum, Siti Drivoka, and Yumna Rasyid. "THE LOGICO-SEMANTIC RELATION OF STUDENTSâ€™ PRESENTATION IN ACCELERATION PROGRAM OF SMA LABSCHOOL JAKARTA." IJLECR - INTERNATIONAL JOURNAL OF LANGUAGE EDUCATION AND CULTURE REVIEW 1, no. 1 (June 1, 2015): 41–54. http://dx.doi.org/10.21009/ijlecr.011.05.

Full text

Abstract:

This study aims at investigating the kinds of taxis and logico-semantic relation of studentsâ€™ presentation in Acceleration Program of SMA Labschool Jakarta. The meanings represented in clause complexes are analyzed based on the concept of relationship between clauses suggested by Halliday (1994: 373). The analysis of taxis and logico-semantic relation is necessary in order to present a pattern of the complexity of the acceleration students. The observation video was recorded in class K-12 then transcribed and analyzed by means of analysis of clause complexes proposed by Gerot and Wignell (1994: 21). The finding in the study shows that the clause complexity in the acceleration studentsâ€™ presentation is varied. In the first group consisting 4 female students, almost all kinds of taxis and logico-semantic are relation found in their presentation, except hypotactic extension. In correspondence with the first group, the second group consisting 4 male students, has produced all kinds of relation except locution. From all groups the type of taxis and logico-semantic relation mostly arises is paratactic elaboration. The analysis of meaning reveals that the dominant meaning is addition which appears from extension

APA, Harvard, Vancouver, ISO, and other styles

23

Leivant, Daniel. "Inductive Completeness of Logics of Programs." Electronic Notes in Theoretical Computer Science 228 (January 2009): 101–12. http://dx.doi.org/10.1016/j.entcs.2008.12.119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Barthe, Gilles, Juan Manuel Crespo, and César Kunz. "Product programs and relational program logics." Journal of Logical and Algebraic Methods in Programming 85, no. 5 (August 2016): 847–59. http://dx.doi.org/10.1016/j.jlamp.2016.05.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Urzyczyn, Pawel. "Logics of Programs with Boolean Memory." Fundamenta Informaticae 11, no. 1 (January 1, 1988): 21–40. http://dx.doi.org/10.3233/fi-1988-11103.

Full text

Abstract:

We discuss the computational power of programs with boolean (propositional) push-down stores and arrays, and the expressive power of logics based on these programs. In particular we show that over unary structures, the mentioned logics occur to be equivalent to their “algebraic counterparts.

APA, Harvard, Vancouver, ISO, and other styles

26

Ilic-Stepic, Angelina, and Zoran Ognjanovic. "Complex valued probability logics." Publications de l'Institut Math?matique (Belgrade) 95, no. 109 (2014): 73–86. http://dx.doi.org/10.2298/pim1409073i.

Full text

Abstract:

We present two complex valued probabilistic logics, LCOMPB and LCOMPS, which extend classical propositional logic. In LCOMPB one can express formulas of the form Bz,?? meaning that the probability of ? is in the complex ball with the center z and the radius ?, while in LCOMPS one can make statements of the form Sz,?? with the intended meaning - the probability of propositional formula ? is in the complex square with the center z and the side 2?. The corresponding strongly complete axiom systems are provided. Decidability of the logics are proved by reducing the satisfiability problem for LCOMPB (LCOMPS) to the problem of solving systems of quadratic (linear) inequalities.

APA, Harvard, Vancouver, ISO, and other styles

27

Fosado Centeno, Ericka. "The Socio-Political Construction of Climate Change: Looking for Paths to Sustainability and Gender Justice." Sustainability 12, no. 8 (April 21, 2020): 3382. http://dx.doi.org/10.3390/su12083382.

Full text

Abstract:

With the purpose of getting to know the cultural and socio-political mechanisms that shape the climate agenda, this study follows a discourse analysis method and a gender perspective, for which an analytical basis is proposed to identify the cognitive, normative, and symbolic components that give meaning and substance to climate policy. Examining the productions of international organizations responsible for generating climate policy, a corpus consisting of 47 documents (reports, communications, programs, and legal framework) was analyzed, spanning from 1994 to 2015, to identify the trend of climate agenda prior to the Paris Agreement. The results indicate that the terms in which climate change is placed as a public issue contribute to reproducing a social order based on an anthropocentric, utilitarian, virtualized, and mercantilist vision of socio-environmental relations. Control mechanisms of peripheral countries and groups whose rights have been breached by discriminatory practices can emerge in this process, with women being especially affected. Based on empirical findings that follow the first two decades of climate policy, the logic underlying the climate discourse is shown, and the challenges it poses to reach more fair and sustainable agreements are discussed. Finally, some proposals are outlined to help guide the climate agenda in that direction.

APA, Harvard, Vancouver, ISO, and other styles

28

Hood, Katherine. "The science of value: Economic expertise and the valuation of human life in US federal regulatory agencies." Social Studies of Science 47, no. 4 (March 21, 2017): 441–65. http://dx.doi.org/10.1177/0306312717693465.

Full text

Abstract:

This article explores efforts to apply economic logic to human life. To do so, it looks at federal regulatory agencies, where government planners and policy makers have spent over a century trying to devise a scientifically sound way to measure the economic value of lives lost or saved by public programs. The methods they have drawn on, however, have changed drastically in the past 40 years, shifting from a ‘human capital’ approach based on models of economic productivity and producing relatively low dollar values to a ‘willingness-to-pay’ approach reflecting consumer choice and producing much higher values. Why, in an era of intense deregulatory pressures, did the valuation model that produced significantly higher estimates – making it easier to justify costly regulation – ultimately win out? This unlikely transition follows a shift in the nature of professional expertise dominating the federal bureaucracy during the 1970s and 1980s, as changing conceptions of health and safety regulation during this period gave academic economists the opportunity to make new claims about the exclusive authority of microeconomic theory for understanding the economic value of life in federal planning. Supporting this argument is a comparative case, the largely unsuccessful attempt to extend the willingness-to-pay model to the valuation of life in the courtroom. Pricing human life thus results not only from the renegotiation of moral boundaries around the economic logic of the market, but also from the reorganization of expert authority and the consolidation of scientific expertise around both the meaning and the measurement of value.

APA, Harvard, Vancouver, ISO, and other styles

29

Pasztor, Ana. "Recursive programs and denotational semantics in absolute logics of programs." Theoretical Computer Science 70, no. 1 (January 1990): 127–50. http://dx.doi.org/10.1016/0304-3975(90)90156-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Brown, Hana E., and Rachel Kahn Best. "Logics of Redistribution." Sociological Perspectives 60, no. 4 (July 1, 2016): 786–809. http://dx.doi.org/10.1177/0731121416656843.

Full text

Abstract:

Social policy scholars disagree about which factors best predict U.S. welfare state generosity. We argue that this disagreement is an artifact of study designs. Researchers usually study either the totality of a state’s social expenditures or one specific program. These approaches overlook the fact that individual social programs were born of different circumstances and serve different constituencies. Comparing state-level policies for Temporary Assistance for Needy Families (TANF), the Children’s Health Insurance Program (CHIP), and the Supplemental Nutrition Assistance Program (SNAP), our findings suggest that these programs are governed by distinct logics of redistribution. Racial characteristics drive TANF generosity. Economic forces best predict CHIP generosity. SNAP generosity is a function of political factors. Qualitative data from Congressional hearings confirm these findings. These results adjudicate between conflicting accounts of the contemporary welfare state and also highlight which aspects of a program’s design make it most susceptible to the effects of racial bias and to partisan politics.

APA, Harvard, Vancouver, ISO, and other styles

31

Antipin, A. F. "Programs evaluation of controllers with programmable logics." Automation, Telemechanization and Communication in Oil Industry, no. 11 (2018): 41–46. http://dx.doi.org/10.30713/0132-2222-2018-11-41-46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sain, Ildikó. "Total correctness in nonstandard logics of programs." Theoretical Computer Science 50, no. 3 (1987): 285–321. http://dx.doi.org/10.1016/0304-3975(87)90118-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Voorneveld, Niels. "Quantitative Logics for Equivalence of Effectful Programs." Electronic Notes in Theoretical Computer Science 347 (November 2019): 281–301. http://dx.doi.org/10.1016/j.entcs.2019.09.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Wasilewska, Anita. "Monadic Second Order Definability as a Common Characterization of Finite Automata, Certain Classes of Programs and Logics." Fundamenta Informaticae 8, no. 3-4 (July 1, 1985): 309–20. http://dx.doi.org/10.3233/fi-1985-83-404.

Full text

Abstract:

We introduce the notion of monadic second order definability (m.s.o definability) of automata, programs and logics and point out some classes of automata (theorem 7), programs (theorem 8) and logics (theorem 9) which are m.s.o definable.

APA, Harvard, Vancouver, ISO, and other styles

35

Szalas, Andrzej. "On strictly arithmetical completeness in logics of programs." Theoretical Computer Science 79, no. 2 (February 1991): 341–55. http://dx.doi.org/10.1016/0304-3975(91)90336-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Dybjer, Peter. "Comparing integrated and external logics of functional programs." Science of Computer Programming 14, no. 1 (June 1990): 59–79. http://dx.doi.org/10.1016/0167-6423(90)90058-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Vardi, Moshe Y., and Pierre Wolper. "Automata-theoretic techniques for modal logics of programs." Journal of Computer and System Sciences 32, no. 2 (April 1986): 183–221. http://dx.doi.org/10.1016/0022-0000(86)90026-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Danko, Wktor. "Axiomatizable Classes in Many-Sorted Logics of Programs." Fundamenta Informaticae 8, no. 3-4 (July 1, 1985): 269–83. http://dx.doi.org/10.3233/fi-1985-83-402.

Full text

Abstract:

In this paper many-sorted logics of programs are considered (cf. Wand [16] and [3]). The aim is to characterize classes of structures axiomatizable by sets of algorithmic formulas. The results are formulated in terms of operations on classes of structures axiomatizable in the first order logic.

APA, Harvard, Vancouver, ISO, and other styles

39

BERTINI, CESARINO, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS." International Journal of Quantum Information 10, no. 03 (April 2012): 1250036. http://dx.doi.org/10.1142/s0219749912500360.

Full text

Abstract:

The theory of gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics, where the meaning of a sentence is identified with a system of qubits in a pure or, more generally, mixed state. In this framework, any formula of the language gives rise to a quantum circuit that transforms the state associated to the atomic subformulas into the state associated to the formula and vice versa. On this basis, some holistic semantic situations can be described, where the meaning of whole determines the meaning of the parts, by non-linear and anti-unitary operators. We prove that the semantics with such operators and the semantics with unitary operators turn out to characterize the same logic.

APA, Harvard, Vancouver, ISO, and other styles

40

Gasmi, Mohamed, and Mustapha Bourahla. "Reasoning with Vague Concepts in Description Logics." International Journal of Fuzzy System Applications 6, no. 2 (April 2017): 43–58. http://dx.doi.org/10.4018/ijfsa.2017040103.

Full text

Abstract:

The open world assumption in ontologies representing knowledge may assign deficient (imprecise) meaning for ontology concepts which are language adjectives referring the meaning of classes of objects (individuals). The interpretation of an imprecise (vague) concept is by three subsets of individuals. The first subset of individuals surely belongs to the vague concept, the second subset of individuals surely doesn't belong the vague concept and the third subset is in the borderline. In this paper, the authors will show that is possible to describe ontology vague concepts using well-defined formal languages. The authors will propose also an extension of the Tableau algorithm for reasoning over vague ontologies.

APA, Harvard, Vancouver, ISO, and other styles

41

Youn, Myung-Chul. "Beauty, meaning, and logics Reflected on King Gwanggaeto's Monument." Journal of Gojiseon & Dangun Studies 30 (June 30, 2014): 283. http://dx.doi.org/10.18706/jgds.2014.06.30.283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

DALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 02 (June 2005): 293–337. http://dx.doi.org/10.1142/s0219749905000943.

Full text

Abstract:

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister (a system of qubits) or, more generally, with a mixture of quregisters (called qumix). In this framework, any sentence α of the language gives rise to a quantum tree: a kind of quantum circuit that transforms the quregister (qumix) associated to the atomic subformulas of α into the quregister (qumix) associated to α. A variant of the quantum computational semantics is represented by the quantum holistic semantics, which permits us to represent entangled meanings. Physical models of quantum computational logics can be built by means of Mach–Zehnder interferometers.

APA, Harvard, Vancouver, ISO, and other styles

43

DALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "QUANTUM COMPUTATIONAL LOGICS AND FOCK SPACE SEMANTICS." International Journal of Quantum Information 03, no. 01 (March 2005): 9–16. http://dx.doi.org/10.1142/s0219749905000372.

Full text

Abstract:

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence α is identified with a quantum information quantity, represented by a density operator of a Hilbert space, whose dimension depends on the logical complexity of α. At the same time, the logical connectives of the language are interpreted as operations defined in terms of quantum logical gates. Standard quantum computational models can be described as special cases of Fock space models, where the meaning of any sentence is localized in a precise sector of a Fock space ℱ. From an intuitive point of view, the increasing number of particles described in the different sectors of ℱ can be interpreted as increasing information.

APA, Harvard, Vancouver, ISO, and other styles

44

BERTINI, CESARINO, and ROBERTO LEPORINI. "QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS." International Journal of Quantum Information 05, no. 05 (October 2007): 641–65. http://dx.doi.org/10.1142/s0219749907003109.

Full text

Abstract:

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quantum information quantity, represented by a quregister (a system of qudits) or, more generally, by a mixture of quregisters (called qumix), whose dimension depends on the logical complexity of the sentence. At the same time, the logical connectives are interpreted as logical operations defined in terms of quantum logical gates. Physical models of quantum computational logics can be built by means of Mach-Zehnder interferometers.

APA, Harvard, Vancouver, ISO, and other styles

45

DE JONGH, DICK H. J., and LEX HENDRIKS. "Characterization of strongly equivalent logic programs in intermediate logics." Theory and Practice of Logic Programming 3, no. 03 (May 2003): 259–70. http://dx.doi.org/10.1017/s147106840200159x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Emerson, E. Allen, and Charanjit S. Jutla. "The Complexity of Tree Automata and Logics of Programs." SIAM Journal on Computing 29, no. 1 (January 1999): 132–58. http://dx.doi.org/10.1137/s0097539793304741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Loyer, Yann, Nicolas Spyratos, and Daniel Stamate. "Hypothesis-based semantics of logic programs in multivalued logics." ACM Transactions on Computational Logic 5, no. 3 (July 2004): 508–27. http://dx.doi.org/10.1145/1013560.1013565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Tiuryn, Jerzy, and Pawel Urzyczyn. "Some relationships between logics of programs and complexity theory." Theoretical Computer Science 60, no. 1 (March 1988): 83–108. http://dx.doi.org/10.1016/0304-3975(88)90052-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Valiev, M. K. "∏11-universality of some propositional logics of concurrent programs." Theoretical Computer Science 119, no. 1 (October 1993): 223–32. http://dx.doi.org/10.1016/0304-3975(93)90347-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

OSORIO, MAURICIO, JUAN A. NAVARRO, and JOSÉ ARRAZOLA. "Applications of intuitionistic logic in Answer Set Programming." Theory and Practice of Logic Programming 4, no. 3 (April 16, 2004): 325–54. http://dx.doi.org/10.1017/s1471068403001881.

Full text

Abstract:

We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence notions and their applications are discussed. Some results on intermediate logics are shown, and applied later to prove properties of answer sets. A characterization of answer sets for logic programs with nested expressions is provided in terms of intuitionistic provability, generalizing a recent result given by Pearce. It is known that the answer set semantics for logic programs with nested expressions may select non-minimal models. Minimal models can be very important in some applications, therefore we studied them; in particular we obtain a characterization, in terms of intuitionistic logic, of answer sets which are also minimal models. We show that the logic G3 characterizes the notion of strong equivalence between programs under the semantic induced by these models. Finally we discuss possible applications and consequences of our results. They clearly state interesting links between ASP and intermediate logics, which might bring research in these two areas together.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!