default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly Lagoon
- > Home > Persons > Vitaly Lagoon
Publications
- 2017
[c19]Michael Codish
, Michael Frank, Vitaly Lagoon:
The DNA Word Design Problem: A New Constraint Model and New Results. IJCAI 2017: 585-591- 2011
- [c18]Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Boolean Equi-propagation for Optimized SAT Encoding. CP 2011: 621-636 - [i5]Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Boolean Equi-propagation for Optimized SAT Encoding. CoRR abs/1104.4617 (2011) - 2008
- [j5]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. J. Satisf. Boolean Model. Comput. 5(1-4): 193-215 (2008) - [j4]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Logic programming with satisfiability. Theory Pract. Log. Program. 8(1): 121-128 (2008) - [c15]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP 2008: 749-753 - 2007
- [i3]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Logic Programming with Satisfiability. CoRR abs/cs/0702072 (2007) - 2006
- [c14]Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey:
Size-Change Termination Analysis in k-Bits. ESOP 2006: 230-245 - [c13]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. LPAR 2006: 30-44 - [c12]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. RTA 2006: 4-18 - [i2]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) - 2005
- [c11]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Testing for Termination with Monotonicity Constraints. ICLP 2005: 326-340 - [i1]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. CoRR abs/cs/0512067 (2005) - 2002
- [c6]Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon:
Combining Norms to Prove Termination. VMCAI 2002: 126-138 - 2000
- [j2]Michael Codish, Vitaly Lagoon, Francisco Bueno:
An Algebraic Approach to Sharing Analysis of Logic Programs. J. Log. Program. 42(2): 111-149 (2000) - [j1]Michael Codish, Vitaly Lagoon:
Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238(1-2): 131-159 (2000) - 1997
- [c4]Francisco Bueno, Michael Codish, Vitaly Lagoon:
Sharing Analysis Using Set Logic Programs. ICLP 1997: 417 - [c3]Michael Codish, Vitaly Lagoon, Francisco Bueno:
An Algebraic Approach to Sharing Analysis of Logic Programs. SAS 1997: 68-82 - 1996
- [c2]Michael Codish, Vitaly Lagoon, Francisco Bueno:
Sharing Analysis for Logic Programs using Set Logic Programs. APPIA-GULP-PRODE 1996: 29-40 - [c1]Michael Codish, Vitaly Lagoon:
Type Dependencies for Logic Programs Using ACI-Unification. ISTCS 1996: 136-145
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
