Filters








4,651 Hits in 5.0 sec

The Automatic Inference of State Invariants in TIM

M. Fox, D. Long
1998 The Journal of Artificial Intelligence Research  
In this paper we describe a process by which state invariants can be extracted from the automatically inferred type structure of a domain.  ...  This knowledge can also be exploited to improve the performance of planners: several researchers have explored the potential of state invariants in speeding up the performance of domain-independent planners  ...  One of the most important of the analyses performed by stan is the automatic inference of state invariants.  ... 
doi:10.1613/jair.544 fatcat:jy32uhthljfonm4q5v2f7gjve4

Where do spontaneous first impressions of faces come from?

Harriet Over, Richard Cook
2018 Cognition  
In this paper, we provide a theoretical account of the origins of these spontaneous trait inferences.  ...  We describe a novel framework (ÔTrait Inference MappingÕ) in which trait inferences are products of mappings between locations in Ôface spaceÕ and Ôtrait spaceÕ.  ...  for automatic trait inferences are products of the environments in which we are raised.  ... 
doi:10.1016/j.cognition.2017.10.002 pmid:29028612 fatcat:o3kw7mgngrcefmhvyy6ndgob4q

Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length [chapter]

Stefan Edelkamp, Malte Helmert
2000 Lecture Notes in Computer Science  
In the second phase we symbolically merge predicates which leads to a drastic reduction of state encoding size, while in the third phase we constrain the domains of the predicates to be considered by enumerating  ...  The process of finding a state description consists of four phases.  ...  Reffel for helpful discussions concerning the symbolic exploration phase. S. Edelkamp and M.  ... 
doi:10.1007/10720246_11 fatcat:cmsxcg5ztbhzblrym3yuzqw2k4

Symbolic Execution with Invariant Inlay: Evaluating the Potential

Eman Alatawi, Tim Miller, Harald Sondergaard
2018 2018 25th Australasian Software Engineering Conference (ASWEC)  
In this paper we outline the invariant inlay approach, and how we have evaluated the idea, in order to determine its usefulness for programs with complex control flow.  ...  However, DSE struggles in the face of execution path explosion, and is often unable to cover certain kinds of difficult-to-reach program points.  ...  The work was also supported by the Australian Research Council through Linkage Grant LP140100437.  ... 
doi:10.1109/aswec.2018.00012 dblp:conf/aswec/AlatawiMS18 fatcat:c5qzizewxjcmnlbe5hfh3gkjbi

Towards Automatic State Recovery for Replanning

Stefan-Octavian Bezrucav, Gerard Canal, Andrew Coles, Michael Cashmore, Burkhard Corves
2022 Zenodo  
In this paper, we formalize the concept of proper states, the mappings between planning states and underlying execution structures, and lay the grounds towards developing automatic recovery behaviors when  ...  However, describing the activities of the agent as action definitions appropriate for planning often requires a discrete abstraction of continuous state.  ...  Gerard Canal is supported by the Royal Academy of Engineering and the Office of the Chief Science Adviser for National Security under the UK Intelligence Community Postdoctoral Research Fellowship programme  ... 
doi:10.5281/zenodo.6637459 fatcat:t77x57duq5bd3onppwxvij3q4y

STAN4: A Hybrid Planning Strategy Based on Subproblem Abstraction

Maria Fox, Derek Long
2001 The AI Magazine  
tition but was restricted in terms of the power of State Invariants in TIM.  ...  The Automatic Inference 84 AI MAGAZINE  ... 
doi:10.1609/aimag.v22i3.1577 dblp:journals/aim/FoxL01 fatcat:2t7xeznagnh2pflh6j36v2gcoa

Interactive proof checking

Thomas Reps, Bowen Alpern
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Knowledge of logical inference rules shows s specialised proof editor to provide a user with feedback about errors in s proof under development.  ...  Providing such feedhlck involves checking a collection of constraints on the strings of the proof IsnKua~e.  ...  We would also like to thank our coHeMues who read the paper and commented on it; the suggestions of Bob Constable, Bob Harper, Susan Horwits, Mark Krentel, Fred Schneider, and Tim Teitelbanm have been  ... 
doi:10.1145/800017.800514 dblp:conf/popl/RepsA84 fatcat:ensoq7fiwnc6rnwiltxfphsndi

Cardinalities and universal quantifiers for verifying parameterized systems

Klaus v. Gleissenthall, Nikolaj Bjørner, Andrey Rybalchenko
2016 Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016  
In this paper we present #Π, an automatic invariant synthesis method that integrates cardinalitybased reasoning and universal quantification.  ...  ., to manage how many processes are in a particular state.  ...  Tools for automatic inference of quantified array invariants can significantly reduce the manual annotation burden [1-4, 41, 49] .  ... 
doi:10.1145/2908080.2908129 dblp:conf/pldi/GleissenthallBR16 fatcat:eeyb2nzip5c7rcz7a5akjqmwqa

Cardinalities and universal quantifiers for verifying parameterized systems

Klaus v. Gleissenthall, Nikolaj Bjørner, Andrey Rybalchenko
2016 SIGPLAN notices  
In this paper we present #Π, an automatic invariant synthesis method that integrates cardinalitybased reasoning and universal quantification.  ...  ., to manage how many processes are in a particular state.  ...  Tools for automatic inference of quantified array invariants can significantly reduce the manual annotation burden [1-4, 41, 49] .  ... 
doi:10.1145/2980983.2908129 fatcat:krn5oanozzdn5a5gjrwrxszrcy

Leveraging abstract interpretation for efficient dynamic symbolic execution

Eman Alatawi, Harald Sondergaard, Tim Miller
2017 2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)  
Loops, in particular those where the number of iterations depends on an input of the program, are a source of path explosion.  ...  We propose a method to increase the coverage achieved by DSE in the presence of input-data dependent loops and loop dependent branches.  ...  The work was also supported by the Australian Research Council through Linkage Grant LP140100437.  ... 
doi:10.1109/ase.2017.8115672 dblp:conf/kbse/AlatawiSM17 fatcat:e344ljpc65chvmzirk6zrlocry

SysML/KAOS Domain Models and B System Specifications [article]

Steve Jeffrey Tueno Fotso, Marc Frappier, Amel Mammar, Régine Laleau
2018 arXiv   pre-print
In this paper, we use a combination of the SysML/KAOS requirements engineering method, an extension of SysML, with concepts of the KAOS goal model, and of the B System formal method.  ...  The translation of this domain model gives the structural part of the B System specification.  ...  Acknowledgment This work is carried out within the framework of the FORMOSE project [6] funded by the French National Research Agency (ANR).  ... 
arXiv:1803.01972v4 fatcat:wqsf76ywarcmdkjlqh226lu3si

Topological image modification for object detection and topological image processing of skin lesions

Robin Vandaele, Guillaume Adrien Nervo, Olivier Gevaert
2020 Scientific Reports  
This ensures that we are able to identify the important objects in relevant regions of the image.  ...  We demonstrate the usefulness of this proposed method for topological image processing through a case-study of unsupervised segmentation of the ISIC 2018 skin lesion images.  ...  Next, research reported in this publication was supported by the National Institute of Biomedical Imaging and Bioengineering (NIBIB) of the National Institutes of Health (NIH), R01 EB020527 and R56 EB020527  ... 
doi:10.1038/s41598-020-77933-y pmid:33273628 pmcid:PMC7713118 fatcat:bmucm7jg2vf27c5duo7evobkqa

bModelTest: Bayesian phylogenetic site model averaging and model comparison

Remco R. Bouckaert, Alexei J. Drummond
2017 BMC Evolutionary Biology  
, a proportion of invariable sites and unequal base frequencies.  ...  The method is implemented in the bModelTest package of the popular BEAST 2 software, which is open source, licensed under the GNU Lesser General Public License and allows joint site model and tree inference  ...  The method is implemented in the bModelTest package of BEAST 2 available from http://beast2.org under LGPL license.  ... 
doi:10.1186/s12862-017-0890-6 pmid:28166715 pmcid:PMC5294809 fatcat:lcs46ao7drgrzcvwa4qgfpwbri

A temporal database with data dependencies: A key to computer integrated manufacturing

Dov Dori, Avigdor Gal, Opher Etzion
1996 International journal of computer integrated manufacturing (Print)  
Th is architecture adds fu nctionality to the CIM datab ase, thereby reducing the program m ing effort required outside the database.  ...  A tem poral database schem e with data dependencies is proposed which supports com plex task s, such as version control an d con® guration m anag ement in com puter integrated m an ufactu ring (CIM ).  ...  Acknowledgem ent The theory of temporal data dependencies discussed in this paper was developed in collaboration with Professor Arie Segev of University of California, Berkeley.  ... 
doi:10.1080/095119296131715 fatcat:xuhltnzjjrbxth4tendlk7eysu

Learning Perceptual Inference by Contrasting [article]

Chi Zhang, Baoxiong Jia, Feng Gao, Yixin Zhu, Hongjing Lu, Song-Chun Zhu
2019 arXiv   pre-print
Combining all the elements, we propose the Contrastive Perceptual Inference network (CoPINet) and empirically demonstrate that CoPINet sets the new state-of-the-art for permutation-invariant models on  ...  Specifically, we borrow the very idea of "contrast effects" from the field of psychology, cognition, and education to design and train a permutation-invariant model.  ...  As shown in Table 4, CoPINet achieves the best performance among all permutation-invariant models, setting a new state-of-the-art on this dataset.  ... 
arXiv:1912.00086v1 fatcat:invw7cwzu5asdgdhirimn4ysqa
« Previous Showing results 1 — 15 out of 4,651 results