Relevant bibliographies by topics / Abstraction

Academic literature on the topic 'Abstraction'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Abstraction.'

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.

Journal articles on the topic "Abstraction"

1

Bonet, Blai. "Abstraction Heuristics Extended with Counting Abstractions." Proceedings of the International Conference on Automated Planning and Scheduling 21 (March 22, 2011): 311–14. http://dx.doi.org/10.1609/icaps.v21i1.13480.

Full text
Abstract:
State-of-the-art abstraction heuristics are those constructed by the merge-and-shrink approach in which an abstraction consists of a labeled transition system, and the composition of abstractions correspond to the synchronized product of transition systems. Merge-and-shrink heuristics build a composite abstraction from atomic abstractions that are directly associated with the variables of the planning problem. In this paper, we show that the framework of labeled transition systems is more general, and propose a new type of abstraction called the counting abstraction. Counting abstractions can be transparently combined with other type of abstractions to get more informative heuristics. We show how to effectively construct the counting abstractions and presents preliminary experiments over benchmark problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Backstrom, Christer, and Peter Jonsson. "Abstracting Abstraction in Search II: Complexity Analysis." Proceedings of the International Symposium on Combinatorial Search 3, no. 1 (August 20, 2021): 10–17. http://dx.doi.org/10.1609/socs.v3i1.18240.

Full text
Abstract:
Modelling abstraction as a function from the original state space to an abstract state space is a common approach in combinatorial search. Sometimes this is too restricted, though, and we have previously proposed a framework using a more flexible concept of transformations between labelled graphs. We also proposed a number of properties to describe and classify such transformations. This framework enabled the modelling of a number of different abstraction methods in a way that facilitated comparative analyses. It is of particular interest that these properties can be used to capture the concept of refinement without backtracking between levels; how to do this has been an open question for at least twenty years. In this paper, we continue our previous research by analysing the complexity of testing the various transformation properties for both explicit and implicit graph~representations.
APA, Harvard, Vancouver, ISO, and other styles
3

Landim Filho, Raul. "A Questão dos Universais Segundo a Teoria Tomista da Abstração." Analytica - Revista de Filosofia 12, no. 2 (August 1, 2013): 11–33. http://dx.doi.org/10.35920/arf.v12i2.540.

Full text
Abstract:
O artigo pretende mostrar que a teoria da abstração de Tomás de Aquino justifica a consistência das seguintes teses: [i] os universais só existem na mente; [ii] fora da mente só existem os singulares e [iii] que tudo no singular é singularizado. O artigo analisa, então, os modos de abstração tomásica: a abstração do todo (ou a do universal a partir do particular), a abstração da forma da matéria sensível e, ainda, o que alguns tomistas consideram também como um modo de abstração: a abstração precisiva. Finalmente, o artigo contrapõe a interpretação de Cajetano da abstração à teoria de Tomás de Aquino e procura mostrar suas semelhanças e suas diferenças. AbstractIn this article, I intend to show that Aquinas´s theory of abstraction explains the consistency of the following theses: [a] universals as such exist only in the soul; [b], only particulars (singulars) exist in nature [c] in particulars everything is singularized. I analyze the two modes of abstraction on Aquinas: abstraction of a whole, that is, abstraction of the universal from the particular (abstraction totius) and abstraction of the form from the sensible matter (abstractio formae). Besides that, I consider another operation of the intellect that some thomists also consider as a mode of abstraction, that is, the operation of precision. At the end of the article I analyze Cajetan's theory of abstraction - total and formal abstraction - aiming to show the differences and similitude between this theory and Aquinas´s.
APA, Harvard, Vancouver, ISO, and other styles
4

Odilovich, Bazarov Oybek. "Abstraction And Language Model." American Journal of Social Science and Education Innovations 02, no. 08 (August 11, 2020): 51–54. http://dx.doi.org/10.37547/tajssei/volume02issue08-08.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ganascia, Jean-Gabriel. "Abstraction of levels of abstraction." Journal of Experimental & Theoretical Artificial Intelligence 27, no. 1 (August 26, 2014): 23–35. http://dx.doi.org/10.1080/0952813x.2014.940685.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

KUNZ, THOMAS. "REVERSE ENGINEERING DISTRIBUTED APPLICATIONS: AN EVENT ABSTRACTION TOOL." International Journal of Software Engineering and Knowledge Engineering 04, no. 03 (September 1994): 303–23. http://dx.doi.org/10.1142/s0218194094000155.

Full text
Abstract:
Understanding the behavior of distributed applications is a very challenging task due to the complexity of these applications. To manage complexity, the top-down use of suitable abstraction hierarchies is frequently proposed. Given the complexity of distributed applications, manually deriving such abstraction hierarchies is not realistic. The execution of distributed applications is typically analyzed using an event-based approach. This paper discusses one tool that groups more primitive events into abstract events to derive a hierarchy of abstract events automatically. Ideally, these abstractions should reveal logical units of an application and their relations. To explore the abstraction hierarchies derived, an existing prototype visualization tool was modified to provide abstract visualizations. A user can navigate through these abstraction hierarchies, displaying an execution at various levels of abstraction. Examples of such abstract visualizations are given and discussed. In general, the abstractions derived automatically represent meaningful parts of the application: they can be interpreted in terms of the application domain. While the abstraction tool does not necessarily derive the best possible abstraction hierarchies in all cases, it performs the bulk of the work and provides good initial abstractions which can subsequently be refined manually.
APA, Harvard, Vancouver, ISO, and other styles
7

Bleeker, Maaike. "Abstraction." Philosophy Today 63, no. 4 (2019): 845–58. http://dx.doi.org/10.5840/philtoday202013296.

Full text
Abstract:
This text elaborates an understanding of abstraction as fundamental to how we think from a closer look at relationships between abstraction, movement, materiality and lived experience. Starting from Whitehead-inspired reflections on ab­straction by Alberto Toscano and Brian Massumi, the differences between their respective readings of his work are shown to be indicative for their different conceptions of the relationships between abstraction, the concrete, and lived experience. The text then continues to elaborate how Alva Noë’s enactive approach to perception illumi­nates the central role of movement and sensorimotor skills in the emergence of abstractions from the continuity of process that is reality, and could contribute to further understanding of the relationship between movement and abstraction as what Massumi describes as the incorporeal dimension of the real. Finally, this text reflects on the potential of movement practices (including dance) and technology to become part of how abstraction is achieved.
APA, Harvard, Vancouver, ISO, and other styles
8

Volsik, Paul. "Abstraction." Word & Image 11, no. 2 (April 1995): 120–28. http://dx.doi.org/10.1080/02666286.1995.10435907.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Men, Chunlin. "Abstraction." Victorian Literature and Culture 51, no. 3 (2023): 355–58. http://dx.doi.org/10.1017/s1060150323000153.

Full text
Abstract:
This essay focuses on “abstraction” as an underresearched keyword in Victorian studies. I argue that the productive ambiguity of abstraction indexes contradictions and tensions in capitalist modernity, statistical thinking, and interdisciplinary mediations that trace significant parts of their histories to the nineteenth century and still heavily inform our current Victorian scholarships.
APA, Harvard, Vancouver, ISO, and other styles
10

Fox, Ian A., and Susan Walker. "Abstraction and abstraction control in Scotland." Science of The Total Environment 294, no. 1-3 (July 2002): 201–11. http://dx.doi.org/10.1016/s0048-9697(02)00068-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Abstraction"

1

Huang, Shan Shan. "Structural abstraction." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29632.

Full text
Abstract:
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.
Committee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugaber. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
2

Payne, Jonathan. "Expansionist abstraction." Thesis, University of Sheffield, 2013. http://etheses.whiterose.ac.uk/3326/.

Full text
Abstract:
The subject of this thesis is a position in the philosophy of mathematics - defended by Bob Hale and Crispin Wright - known variously as neo-Fregeanism, neo-Logicism or abstractionism, and which claims that knowledge of mathematical objects can be based on principles - known as abstraction principles - which are in important respects like definitions of mathematical language. In the thesis, I make a distinction between two ways in which the abstraction programme might be carried out. These are the standardly defended static view, according to which abstraction principles can used to discover previously unrecognised objects lying within some fixed domain of quantification. The second is an expansionist view, according to which abstraction principles allow one to introduce new quantificational vocabulary, and thus expand ones domain of quantification to one which contains referents of mathematical terms. There are then two main aims. The first is to examine the static position, so as to identify the components of that view which make it committed to a standard domain, and to argue against the view. My main argument against the view concerns what has become known as the bad company problem. I argue that there is an epistemological component to the bad company problem which can not be avoided by the static abstractionist. The second aim of the thesis is to argue for and defend the expansionist view. In particular, I will claim that the expansionist view avoids the bad company problem, and that the expansionist view allows for an abstractionist foundation for set theory - an aim which (or so I will argue) has so far eluded the static view.
APA, Harvard, Vancouver, ISO, and other styles
3

Stewart, Nicholas. "Abstraction and comedy." Thesis, Goldsmiths College (University of London), 2013. http://research.gold.ac.uk/9922/.

Full text
Abstract:
The thesis, consisting of an extended artwork (Toy Zoo) and a theoretical text, aims to explore a concept of abstraction and relate this concept to an affect of comedy. The proposal of the thesis is that abstraction, looked at in a proper way, is funny. Abstraction is imagined not as the absence of ‘content’ or the generalization of form, but as a condition of language occasioned by a categorical loss, the loss of the ground that attaches meaning to a thing. The work takes this dissonance in language as its subject-matter. In a series of photographic images, representations of mental or conceptual objects whose mode of representation alters the meaning of the term, it presents abstraction not as a formal reduction or the presentation of a higher order but as the historical view of a void subject-position. Its argument is that the view from this position is comic. The text develops a concept of abstraction from Hegel’s description of ‘the abstract work of art’. This ‘absolute’ abstraction, a condition in society to which art responds, is the premise through which various forms of abstract production, in art and elsewhere, are read. The generic forms of the epic, tragedy and comedy, as analyzed by Hegel, provide models that are applied in the context of ‘real abstraction’ and to certain positions in art. An analysis of value in capital aims to identify the logic of this form of production with the structure of tragedy. Against this ‘ready-made’ abstraction of modernity, the non-dialectical relationship of abstract necessity and the individual, the text argues for a form of comedy. Comedy, as a genre in art, proposes a subject-position that, recognizing itself in abstraction, recognizes abstraction not, as in ‘real abstraction’, as necessity but as the condition of its own freedom.
APA, Harvard, Vancouver, ISO, and other styles
4

Rayside, Derek F. "Automating abstraction functions." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62439.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 109-119).
Data abstraction has been the dominant structuring paradigm for programs for decades. The essence of a data abstraction is the abstraction function, which relates the concrete program representation to its abstract meaning. However, abstraction functions are not generally considered to be a part of the executing program. We propose that making abstraction functions an executable part of the program can enable programmers to write clearer and more concise programs with fewer errors. In particular, we show that the object equality and hashing operations (which programmers are required to write), can often be expressed more clearly and more concisely in terms of the abstract state of the object. Getting these methods right has proven to be difficult for programmers at all skill levels, from novice through expert. In a case study of the standard Java libraries we show that rewriting the code with explicit declarative abstraction functions (and generating equality and hashing methods automatically) removed object-contract compliance faults previously found by Pacheco et al. To make abstraction functions part of the executing program we develop four techniques for the dynamic evaluation of abstraction functions written in a declarative first-order logic with relations and transitive closure. We observe that the abstraction functions programmers write in practice may often be viewed as navigation queries on the heap, and two of our techniques exploit this insight to synthesize executable code from declarative abstraction functions. The performance of our research prototype is within striking distance of hand-written code.
by Derek F. Rayside.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
5

Koniski, Grant. ""The Unprogrammed Abstraction"." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1592135457002889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Barthélemy, Anne. "Abstraction et photographie /." [Rennes] : l'auteur, 1997. http://catalogue.bnf.fr/ark:/12148/cb370661876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Girgin, Sertan. "Abstraction In Reinforcement Learning." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608257/index.pdf.

Full text
Abstract:
Reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment. Generally, the problem to be solved contains subtasks that repeat at different regions of the state space. Without any guidance an agent has to learn the solutions of all subtask instances independently, which degrades the learning performance. In this thesis, we propose two approaches to build connections between different regions of the search space leading to better utilization of gained experience and accelerate learning is proposed. In the first approach, we first extend existing work of McGovern and propose the formalization of stochastic conditionally terminating sequences with higher representational power. Then, we describe how to efficiently discover and employ useful abstractions during learning based on such sequences. The method constructs a tree structure to keep track of frequently used action sequences together with visited states. This tree is then used to select actions to be executed at each step. In the second approach, we propose a novel method to identify states with similar sub-policies, and show how they can be integrated into reinforcement learning framework to improve the learning performance. The method uses an efficient data structure to find common action sequences started from observed states and defines a similarity function between states based on the number of such sequences. Using this similarity function, updates on the action-value function of a state are reflected to all similar states. This, consequently, allows experience acquired during learning be applied to a broader context. Effectiveness of both approaches is demonstrated empirically by conducting extensive experiments on various domains.
APA, Harvard, Vancouver, ISO, and other styles
8

Smirnov, Sergey. "Business process model abstraction." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2012/6025/.

Full text
Abstract:
Business process models are used within a range of organizational initiatives, where every stakeholder has a unique perspective on a process and demands the respective model. As a consequence, multiple process models capturing the very same business process coexist. Keeping such models in sync is a challenge within an ever changing business environment: once a process is changed, all its models have to be updated. Due to a large number of models and their complex relations, model maintenance becomes error-prone and expensive. Against this background, business process model abstraction emerged as an operation reducing the number of stored process models and facilitating model management. Business process model abstraction is an operation preserving essential process properties and leaving out insignificant details in order to retain information relevant for a particular purpose. Process model abstraction has been addressed by several researchers. The focus of their studies has been on particular use cases and model transformations supporting these use cases. This thesis systematically approaches the problem of business process model abstraction shaping the outcome into a framework. We investigate the current industry demand in abstraction summarizing it in a catalog of business process model abstraction use cases. The thesis focuses on one prominent use case where the user demands a model with coarse-grained activities and overall process ordering constraints. We develop model transformations that support this use case starting with the transformations based on process model structure analysis. Further, abstraction methods considering the semantics of process model elements are investigated. First, we suggest how semantically related activities can be discovered in process models-a barely researched challenge. The thesis validates the designed abstraction methods against sets of industrial process models and discusses the method implementation aspects. Second, we develop a novel model transformation, which combined with the related activity discovery allows flexible non-hierarchical abstraction. In this way this thesis advocates novel model transformations that facilitate business process model management and provides the foundations for innovative tool support.
Geschäftsprozessmodelle werden in einer Fülle organisatorischer Initiativen eingesetzt, wobei verschiedene Stakeholder individuelle Ansprüche an die Sicht auf den jeweiligen Prozess haben. Dies führt dazu, dass zu einem Geschäftsprozess eine Vielzahl unterschiedlicher Modelle existiert. In einer sich ständig verändernden Geschäftsumgebung ist es daher schwierig, diese Vielzahl von Modellen konsistent zu halten: Ändert sich sich ein Prozess, müssen alle Modelle, die ihn beschreiben, aktualisiert werden. Aufgrund der schieren Menge an Prozessmodellen und ihrer komplexen Beziehungen zueinander, erhöhen sich Aufwand und Kosten zur Pflege aller Modelle enorm. Vor diesem Hintergrund ermöglicht die Abstraktion von Geschäftsprozessmodellen, die Menge der Modelle zu reduzieren und damit ihre Verwaltung zu vereinfachen. Abstraktion von Geschäftsprozessmodellen bezeichnet eine Transformation eines Prozessmodells, so dass es für einen bestimmten Zweck besonders geeignet ist. Bei der Abstraktion von Geschäftsprozessen bleiben essentielle Eigenschaften eines Modells erhalten, während irrelevante Eigenschaften verworfen werden. Mehrere Studien stellen Prozessmodellabstraktion in den Fokus und konzentrieren sich auf konkrete Anwendungsfälle, für die sie geeignete Transformationen entwickelt haben. Diese Dissertation untersucht das Problem der Prozessmodellabstraktion und systematisiert die Lösung in einem Framework. Aktuelle Anforderungen der Industrie an die Abstraktion von Prozessmodellen wurden recherchiert und in einem Katalog von Anwendungsfällen zusammengefasst, von denen ein besonderer für die weiteren Untersuchungen ausgewählt wurde. In diesem Fall erwartet der Nutzer ein Modell niedrigeren Detailgrades, in welchem die Kontrollflussbeziehungen des Ursprungsmodells erhalten bleiben. Beginnend bei Modelltransformationen, die auf der Analyse der Prozessmodellstruktur aufbauen, entwickeln wir neuartige Abstraktionsoperationen zur Unterstützung dieses Anwendungsfalles. Darüber hinaus untersuchen wir Abstraktionsmethoden, welche die Semantik von Prozessmodellelementen berücksichtigen. Zum einen zeigen wir, wie Aktivitäten ermittelt werden können, die miteinander in semantischer Beziehung stehen - ein Problem, das bisher nur unzureichend betrachtet wurde. Die vorgeschlagenen Methoden werden mithilfe industrieller Prozessmodellsammlungen validiert und deren Umsetzung diskutiert. Zum anderen schlagen wir eine innovative Modelltransformation zur nicht-hierarchischen Abstraktion von Prozessmodellen vor. Dieser liegt die Ermittlung in Beziehung stehender Aktivitäten zugrunde. Demzufolge präsentiert diese Arbeit eine originäre Methode zur Prozessmodellabstraktion, die die Verwaltung von Geschäftsprozessmodellen vereinfacht und den Grundstein für innovative Softwarewerkzeuge legt.
APA, Harvard, Vancouver, ISO, and other styles
9

Clark, Allan. "Abstraction-level functional programming." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/24458.

Full text
Abstract:
This thesis is concerned with the abstraction-level programming, where abstraction-level is the level of programming tasks which extend the abstraction of the machine. Extending the abstraction of the machine is generally done by compiler writers for high-level programming languages or those implementing an interface to lower-level or legacy libraries. The abstractions which are implemented are then used, either explicitly or implicitly, by the high-level language programmer. The main aim of the abstraction is often to increase programmer productivity but can also be for efficiency or security reasons. Implementing an automatic runtime garbage collector is a common example of an abstraction-level programming task. To date most abstraction-level programming has been done in low-level programming languages such as C. The contents of this thesis describes an investigation into the design of a functional language Nitro, for use in abstraction-level programming. The main goal is to provide the abstraction-level programmer with some of the benefits enjoyed by high-level functional language programmers.
APA, Harvard, Vancouver, ISO, and other styles
10

Johnson, Mary Vaughan. "Space, embodiment and abstraction." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Abstraction"

1

Architecture, National University of Singapore Dept of. Abstractions: 1/2 : sensing, abstraction, expression. Singapore: Dept. of Architecture, School of Design and Environment, National University of Singapore, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

E, Benjamin Andrew, ed. Abstraction. London: Academy Editions, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Richard, Shiff, Hoberg Annegret, and Art Gallery of New South Wales, eds. Abstraction: Paths to abstraction, 1867-1917. Sydney: Art Gallery of New South Wales, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

1924-, Danto Arthur Coleman, and Anderson Gallery, eds. Repicturing abstraction. [Richmond, Va.]: Anderson Gallery, Virginia Commonwealth University, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Norbert, Pfaffenbichler, Droschl Sandro, and Künstlerhaus Wien, eds. Abstraction now. Graz: Edition Camera Austria, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Charles, Giuliano, Montserrat College of Art. Gallery., Arno Maris Gallery, and Boston College Art Gallery, eds. Subjective abstraction. Beverly, Mass: The Art Gallery, Montserrat College of Art, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hesdi. Musical abstraction. [Jakarta]: Hexart Pub., 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Belmonte, Matthew. Full abstraction. Ithaca, N.Y: Pathos Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1960-, Mercer Kobena, ed. Discrepant abstraction. London: Institute of International Visual Arts, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Velkov, Vlado, and Beeson John. Public abstraction. Arnsberg: Kunstverein Arnsberg, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Abstraction"

1

Dams, Dennis, and Orna Grumberg. "Abstraction and Abstraction Refinement." In Handbook of Model Checking, 385–419. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-10575-8_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hetland, Magnus Lie. "Abstraction." In Beginning Python, 101–27. Berkeley, CA: Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-0028-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mardan, Azat. "Abstraction." In Pro Express.js, 155–60. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0037-7_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alagar, V. S., and K. Periyasamy. "Abstraction." In Specification of Software Systems, 31–38. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2920-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Thalheim, Bernhard. "Abstraction." In Encyclopedia of Database Systems, 1–3. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_4-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hazzan, Orit, and Yael Dubinsky. "Abstraction." In Agile Anywhere, 53–55. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10157-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fiedler, Johannes. "Abstraction." In Urbanisation, unlimited, 1–13. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-03587-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thalheim, Bernhard. "Abstraction." In Encyclopedia of Database Systems, 6–7. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

van Gigch, John P. "Abstraction." In System Design Modeling and Metamodeling, 233–54. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-0676-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tierny, Julien. "Abstraction." In Mathematics and Visualization, 35–66. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71507-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Abstraction"

1

Cui, Zhenhe, Yongmei Liu, and Kailun Luo. "A Uniform Abstraction Framework for Generalized Planning." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/253.

Full text
Abstract:
Generalized planning aims at finding a general solution for a set of similar planning problems. Abstractions are widely used to solve such problems. However, the connections among these abstraction works remain vague. Thus, to facilitate a deep understanding and further exploration of abstraction approaches for generalized planning, it is important to develop a uniform abstraction framework for generalized planning. Recently, Banihashemi et al. proposed an agent abstraction framework based on the situation calculus. However, expressiveness of such an abstraction framework is limited. In this paper, by extending their abstraction framework, we propose a uniform abstraction framework for generalized planning. We formalize a generalized planning problem as a triple of a basic action theory, a trajectory constraint, and a goal. Then we define the concepts of sound abstractions of a generalized planning problem. We show that solutions to a generalized planning problem are nicely related to those of its sound abstractions. We also define and analyze the dual notion of complete abstractions. Finally, we review some important abstraction works for generalized planning and show that they can be formalized in our framework.
APA, Harvard, Vancouver, ISO, and other styles
2

Saribatur, Zeynep G., and Johannes P. Wallner. "Existential Abstraction on Argumentation Frameworks via Clustering." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/52.

Full text
Abstract:
Argumentation in Artificial Intelligence (AI) builds on formal approaches to reasoning argumentatively. Common to many such approaches is to use argumentation frameworks (AFs) as reasoning engines, with AFs being composed of arguments and attacks between arguments, which are instantiated from knowledge bases in a principle-based manner. While representing what can be argued for in an AF provides a conceptually clean way, this process can face challenges arising from generating a large number of arguments, which can act as a barrier to explainability. Inspired by successful approaches to model checking where the state explosion is mitigated by applying existential abstraction, we study an adaption of existential abstraction in form of clustering arguments in an AF to address an associated "argument explosion". In this paper, we provide a foundational investigation of this form of existential abstraction by defining semantics of the resulting clustered AFs, which balance two inherent aspects of existential abstractions: abstracting from concrete AFs and not permitting too much spuriousness (i.e., conclusions that hold on the abstraction but not on the original AF). Moreover, we show properties of clustered AFs, including complexity results, discuss use of clusterings for explaining results of reasoning tasks, and employ the recently introduced methodology of abstraction in answer set programming (ASP) for obtaining and reasoning over clustered AFs.
APA, Harvard, Vancouver, ISO, and other styles
3

Kask, Kalev, Bobak Pezeshki, Filjor Broka, Alexander Ihler, and Rina Dechter. "Scaling Up AND/OR Abstraction Sampling." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/589.

Full text
Abstract:
Abstraction Sampling (AS) is a recently introduced enhancement of Importance Sampling that exploits stratification by using a notion of abstractions: groupings of similar nodes into abstract states. It was previously shown that AS performs particularly well when sampling over an AND/OR search space; however, existing schemes were limited to ``proper'' abstractions in order to ensure unbiasedness, severely hindering scalability. In this paper, we introduce AOAS, a new Abstraction Sampling scheme on AND/OR search spaces that allow more flexible use of abstractions by circumventing the properness requirement. We analyze the properties of this new algorithm and, in an extensive empirical evaluation on five benchmarks, over 480 problems, and comparing against other state of the art algorithms, illustrate AOAS's properties and show that it provides a far more powerful and competitive Abstraction Sampling framework.
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Dongge, and Sebastian Tschiatschek. "Option Transfer and SMDP Abstraction with Successor Features." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/421.

Full text
Abstract:
Abstraction plays an important role in the generalisation of knowledge and skills and is key to sample efficient learning. In this work, we study joint temporal and state abstraction in reinforcement learning, where temporally-extended actions in the form of options induce temporal abstractions, while aggregation of similar states with respect to abstract options induces state abstractions. Many existing abstraction schemes ignore the interplay of state and temporal abstraction. Consequently, the considered option policies often cannot be directly transferred to new environments due to changes in the state space and transition dynamics. To address this issue, we propose a novel abstraction scheme building on successor features. This includes an algorithm for transferring abstract options across different environments and a state abstraction mechanism that allows us to perform efficient planning with the transferred options.
APA, Harvard, Vancouver, ISO, and other styles
5

Cui, Zhenhe, Weidu Kuang, and Yongmei Liu. "Automatic Verification for Soundness of Bounded QNP Abstractions for Generalized Planning." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/351.

Full text
Abstract:
Generalized planning (GP) studies the computation of general solutions for a set of planning problems. Computing general solutions with correctness guarantee has long been a key issue in GP. Abstractions are widely used to solve GP problems. For example, a popular abstraction model for GP is qualitative numeric planning (QNP), which extends classical planning with non-negative real variables that can be increased or decreased by some arbitrary amount. The refinement of correct solutions of sound abstractions are solutions with correctness guarantees for GP problems. More recent literature proposed a uniform abstraction framework for GP and gave model-theoretic definitions of sound and complete abstractions for GP problems. In this paper, based on the previous work, we explore automatic verification of sound abstractions for GP. Firstly, we present a proof-theoretic characterization for sound abstractions. Secondly, based on the characterization, we give a sufficient condition for sound abstractions with deterministic actions. Then we study how to verify the sufficient condition when the abstraction models are bounded QNPs where integer variables can be incremented or decremented by one. To this end, we develop methods to handle counting and transitive closure, which are often used to define numerical variables. Finally, we implement a sound bounded QNP abstraction verification system and report experimental results on several domains.
APA, Harvard, Vancouver, ISO, and other styles
6

Brenner, Markus, and Birte Glimm. "Embracing Change by Abstraction Materialization Maintenance for Large ABoxes." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/244.

Full text
Abstract:
Abstraction Refinement is a recently introduced technique which allows for reducing materialization of an ontology with a large ABox to materialization of a smaller (compressed) `abstraction' of this ontology. In this paper, we show how Abstraction Refinement can be adopted for incremental ABox materialization by combining it with the well-known DRed algorithm for materialization maintenance. Such a combination is non-trivial and to preserve soundness and completeness, already Horn ALCHI requires more complex abstractions. Nevertheless, we show that significant benefits can be obtained for synthetic and real-world ontologies.
APA, Harvard, Vancouver, ISO, and other styles
7

Zennaro, Fabio Massimo, Paolo Turrini, and Theodoros Damoulas. "Quantifying Consistency and Information Loss for Causal Abstraction Learning." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/638.

Full text
Abstract:
Structural causal models provide a formalism to express causal relations between variables of interest. Models and variables can represent a system at different levels of abstraction, whereby relations may be coarsened and refined according to the need of a modeller. However, switching between different levels of abstraction requires evaluating a trade-off between the consistency and the information loss among different models. In this paper we introduce a family of interventional measures that an agent may use to evaluate such a trade-off. We consider four measures suited for different tasks, analyze their properties, and propose algorithms to evaluate and learn causal abstractions. Finally, we illustrate the flexibility of our setup by empirically showing how different measures and algorithmic choices may lead to different abstractions.
APA, Harvard, Vancouver, ISO, and other styles
8

Snavely, Gary L., and Panos Y. Papalambros. "Abstraction As a Configuration Design Methodology." In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0317.

Full text
Abstract:
Abstract Configuration design can be thought of as a process of generating artifacts by assembling pre-defined components. This paper introduces a method for reducing the size of configuration problems by abstracting components to higher levels of abstraction. At higher abstraction levels, less important detail is temporarily ignored, and each component represents a family of lower-level components. Configuration is then performed at the highest level, explicitly enumerating all configurations at that level. Any complete configuration at the highest level is recursively instantiated to lower levels. At the same time, any incomplete configuration at the highest level is eliminated, thereby eliminating all possible lower-level instantiations of that configuration. In this manner, all configurations of components at the lowest level of abstraction are implicitly enumerated.
APA, Harvard, Vancouver, ISO, and other styles
9

Čermák, Jiří, Viliam Lisý, and Branislav Bošanský. "Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/701.

Full text
Abstract:
Information abstraction is one of the methods for tackling large extensive-form games (EFGs). Removing some information available to players reduces the memory required for computing and storing strategies. We present novel domain-independent abstraction methods for creating very coarse abstractions of EFGs that still compute strategies that are (near) optimal in the original game. First, the methods start with an arbitrary abstraction of the original game (domain-specific or the coarsest possible). Next, they iteratively detect which information is required in the abstract game so that a (near) optimal strategy in the original game can be found and include this information into the abstract game. Moreover, the methods are able to exploit imperfect-recall abstractions where players can even forget the history of their own actions. We present two algorithms that follow these steps -- FPIRA, based on fictitious play, and CFR+IRA, based on counterfactual regret minimization. The experimental evaluation confirms that our methods can closely approximate Nash equilibrium of large games using abstraction with only 0.9% of information sets of the original game.
APA, Harvard, Vancouver, ISO, and other styles
10

Saribatur, Zeynep G., Thomas Eiter, and Peter Schüller. "Abstraction for Non-Ground Answer Set Programs (Extended Abstract)." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/807.

Full text
Abstract:
Abstraction is a powerful technique that has not been considered much for nonmonotonic reasoning formalisms including Answer Set Programming (ASP), apart from related simplification methods. We introduce a notion for abstracting from the domain of an ASP program that shrinks the domain size and over-approximates the set of answer sets, as well as an abstraction-&-refinement methodology that, starting from an initial abstraction, automatically yields an abstraction with an associated answer set matching an answer set of the original program if one exists. Experiments reveal the potential of the approach, by its ability to focus on the program parts that cause unsatisfiability and by achieving concrete abstract answer sets that merely reflect relevant details.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Abstraction"

1

Obua, Steven. Abstraction Logic. Recursive Mind, November 2021. http://dx.doi.org/10.47757/abstraction.logic.2.

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-order logic and second-order logic. It is sound with respect to an intuitive and simple algebraic semantics. Completeness holds for both intuitionistic and classical abstraction logic, and all abstraction logics in between and beyond.
APA, Harvard, Vancouver, ISO, and other styles
2

Obua, Steven. Abstraction Logic. Steven Obua (as Recursive Mind), October 2021. http://dx.doi.org/10.47757/abstraction.logic.1.

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-order logic and second-order logic. It is sound and complete with respect to an intuitive and simple algebraic semantics.
APA, Harvard, Vancouver, ISO, and other styles
3

C. Leigh. Inventory Abstraction. Office of Scientific and Technical Information (OSTI), November 2000. http://dx.doi.org/10.2172/837101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

G. Ragan. INVENTORY ABSTRACTION. Office of Scientific and Technical Information (OSTI), December 2001. http://dx.doi.org/10.2172/861077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sugisaka, Masanori, and Jeffrey Johnson. Construct Abstraction for Automatic Information Abstraction from Digital Images. Fort Belvoir, VA: Defense Technical Information Center, May 2006. http://dx.doi.org/10.21236/ada455945.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

QUITTMEYER R C. SEISMIC CONSEQUENCE ABSTRACTION. Office of Scientific and Technical Information (OSTI), August 2005. http://dx.doi.org/10.2172/882869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

M. Gross. Seismic Consequence Abstraction. Office of Scientific and Technical Information (OSTI), October 2004. http://dx.doi.org/10.2172/837501.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Obua, Steven. Automating Abstraction Logic. Steven Obua (trading as Recursive Mind), March 2022. http://dx.doi.org/10.47757/aal.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

J. Prouty. EBS Radionuclide Transport Abstraction. Office of Scientific and Technical Information (OSTI), July 2006. http://dx.doi.org/10.2172/893806.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

J.D. Schreiber. EBS Radionuclide Transport Abstraction. Office of Scientific and Technical Information (OSTI), August 2005. http://dx.doi.org/10.2172/893809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Abstraction' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography