Conecte-se

Bibliografias temáticas / Logics and meaning of programs / Artigos de revistas

Siga este link para ver outros tipos de publicações sobre o tema: Logics and meaning of programs.

Artigos de revistas sobre o tema "Logics and meaning of programs"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 1 de fevereiro de 2022

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Logics and meaning of programs".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 cha

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 resu

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 st

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 p

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 pro

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 sys

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 pro

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 fram

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 tru

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 Will

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 indu

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

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

Texto completo da fonte

Resumo:

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 ba

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 (19

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 LCOMP

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 c

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 fi

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 oper

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 form

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 mean

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 semanti

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!